public class Solution {
public int binarySearch0(int[] num, int l, int h, int target){//普通的二分查找
while(l <= h){
int mid = l + (( h - l) >> 1);
if(num[mid] > target) h = mid - 1;
else if(num[mid] < target) l = mid + 1;
else return mid;
}
return -1;
}
public int binarySearch(int[] num, int start, int end, int target){
if(num[start] < num[end]) return binarySearch0(num, start, end, target);
if(start > end) return -1;
if(start == end){
if(num[start] == target) return start;
else return -1;
}
if(start + 1 == end){//递归出现溢出的情况,都是两个元素的时候,mid = start或者 mid = end 所以 特殊处理以防止栈溢出
if(num[start] == target) return start;
else if(num[end] == target) return end;
else return -1;
}
int mid = start + ((end - start) >> 1);
if(num[mid] == target) return mid;
if(num[mid] > num[start]){//按大小分情况讨论
if(target > num[mid] || target <= num[end]) return binarySearch(num, mid + 1, end ,target);
else if(num[start] <= target && target < num[mid]) return binarySearch(num, start, mid - 1 ,target);
else return -1;
}
else{
if(target >= num[start] || target < num[mid]) return binarySearch(num, start, mid - 1 ,target);
else if(num[mid] < target && target <= num[end]) return binarySearch(num, mid + 1, end ,target);
else return -1;
}
}
public int search(int[] A, int target) {
return binarySearch(A, 0 ,A.length - 1, target);
}
}
【LeetCode】Search in Rotated Sorted Array
最新推荐文章于 2024-05-03 20:14:24 发布