class Solution {
public int search(int[] nums, int target) {
int N=nums.length;
if (N == 0) return -1;
if (N == 1) return nums[0] == target ? 0 : -1;
int l = 0 , r = N-1;
while(l<r){
int mid = l+r+1>>1;
if(nums[mid]>=nums[0]) l = mid;
else r = mid - 1;
}
if(target>=nums[0]){
l=0;
}
else{
l+=1;
r = nums.length-1;
}
while(l<r){
int mid = l+r>>1;
if(nums[mid]>=target) r = mid;
else l = mid+1;
}
return nums[r] == target ? r : -1;
}
}
07162021