力扣------搜索旋转排序数组

int search(int* nums, int numsSize, int target){
    int left=0;
    int right=numsSize-1;
    while(left<=right){
        if(nums[left]==target){
            return left;
        }
        if(nums[right]==target){
            return right;
        }
        left++;
        right--;
    }
    return -1;
}