33. Search_in_rotated_sorted_array.java

class Solution
{
    public int search(int[] nums, int target) 
    {
        int count=0;
        for(int i=0; i<nums.length; i++){
            if(nums[i] != target){
                count++;
            }else{
                if(nums[i] == target){
                    return count; 
                }
            }
        }
        return -1;
    }
}