LeetCode:33.搜索旋转排序数组

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