题目
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).
Write a function to determine if a given target is in the array.
The array may contain duplicates.
分析
这个题依然可以用二分法,和前面题类似。考虑到可能重复,如果重复午饭判断所在范围,可以让high–;
class Solution {
public static boolean search(int[] nums, int target) {
if (nums.length == 0) {
return false;
}
int low = 0;
int high = nums.length-1;
while (high-low>=2) {
int mid = (low+high)/2;
if (nums[mid] == nums[low]) {
low++;
} else if (nums[mid] == nums[high]) {
high--;
} else {
if (nums[high]>nums[low]) {
if (nums[mid] > target) {
high = mid;
} else {
low = mid;
}
} else {
if (nums[mid]>nums[low]) {
if (target >= nums[low] && target <= nums[mid]) {
high = mid;
} else {
low = mid;
}
} else {
if (target >= nums[mid] && target <= nums[high]) {
low = mid;
} else {
high = mid;
}
}
}
}
}
if (nums[high]!=target && nums[low]!=target) {
return false;
}
else {
return true;
}
}
}