public static int search(int []nums, int target){
int left = 0;
int right = nums.length - 1;
while(left <= right){
int mid = left + (right - left)/2; // 2
if(nums[mid] == target){
return mid;
}
if(nums[mid] > nums[left]){
if(nums[left] <= target &&target<= nums[mid]){
right = mid - 1;
}
else{
left = mid + 1;
}
}
else{
if(nums[mid] <= target &&target<= nums[right]){
left = mid + 1;
}
else{
right = mid - 1;
}
}
}
return -1;
}
Search in Rotated Sorted Array
最新推荐文章于 2020-06-01 16:44:28 发布