(33)Search in a rotated sorted array

class Solution {
public:
    int search(vector<int>& nums, int target) 
    {
        int n = nums.size();
        int ans;
        
        for(int i=0 ; i<n ; i++)
        {
            if(target==nums[i])
            {
                ans=i;
                break;
            }
            else
            {
                ans=-1;
            }
        }
        return ans;
    }
};