33. Search in Rotated Sorted Array在旋转排序数组中找目标值的位置
int search(vector<int>& nums, int target) {
        int len=nums.size();
        int low=0,high=len-1;
        while(low<=high){
            int mid=(low+high)/2;
            if(nums[mid]==target){
                return mid;
            }
            //mid在旋转点左侧
            if(nums[mid]<nums[low]){
                if(nums[mid]<target&&target<=nums[high]){
                    low=mid+1;
                }else{
                    high=mid-1;
                }
            }
            //mid在旋转点右侧
            else if(nums[mid]>nums[high]){
                if(nums[mid]>target&&target>=nums[low]){
                    high=mid-1;
                }else{
                    low=mid+1;
                }
            }
            else{
                if(nums[mid]<target){
                    low=mid+1;
                }else{
                    high=mid-1;
                }
            }
        }
        return -1;
    }