【leetcode】Search Rotated Sorted Array

Suppose a sorted array is rotated at some pivot unknown to you beforehand.

(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).

You are given a target value to search. If found in the array return its index, otherwise return -1.

You may assume no duplicate exists in the array.

 

class Solution {
public:
    int search(vector<int>& nums, int target) {
        //if(nums.size()==0) return ;

        for(int i=0;i<nums.size();i++)
        {
            if(target==nums[i])
                return i;
        }

        return -1;
    }
};