https://leetcode-cn.com/problems/search-in-rotated-sorted-array/
题解1：两次二分 第一次判断从0-r的升序数组 若target>=nums[0] 说明结果在r+1以后 再进行一次二分即可 ps：最后返回要返回r l有可能越界(l = r+1)；
class Solution { public: int search(vector<int>& nums, int target) { if(!nums.size()) return -1; int l = 0,r = nums.size()-1; while(l<r) { int mid = (l+r+1)>>1; if(nums[0]<=nums[mid]) l = mid; else r = mid-1; } if(target>=nums[0]) l = 0;// else l = r+1,r = nums.size()-1; while(l<r) { int mid = (l+r)>>1; if(nums[mid]>=target) r = mid; else l = mid+1; } if(nums[r]==target) return r; return -1; } };