LeetCode.81 搜索旋转排序数组
注意:
- 通过mid和左边数字大小可以判断到底是左边有序还是右边有序
- 需要处理重复数字最后才能通过???
代码:
class Solution {
public boolean search(int[] nums, int target) {
if (nums.length == 0) {
return false;
}
int start = 0, end = nums.length - 1;
while (start <= end) {
// 处理重复数字
while (start < end && nums[start] == nums[start + 1]) {
start++;
}
while (start < end && nums[end] == nums[end - 1]) {
end--;
}
int mid = (start + end) / 2;
if (nums[mid] == target) {
return true;
}
if (nums[mid] >= nums[start]) {
// 左边有序{4,5,6,1,2,3}
if (target < nums[mid] && target >= nums[start]) {
end = mid - 1;
} else {
start = mid + 1;
}
} else {
// 右边有序
if (target > nums[mid] && target <= nums[end]) {
start = mid + 1;
} else {
end = mid - 1;
}
}
}
return false;
}
}