题目链接
法一(二分)
public boolean search(int[] nums, int target) {
int left = 0, right = nums.length - 1;
while (left <= right) {
int mid = left + (right - left) / 2;
if (nums[mid] == target) {
return true;
} else if (nums[mid] < nums[right]) {
if (target > nums[mid] && target <= nums[right]) {
left = mid + 1;
} else {
right = mid - 1;
}
} else if (nums[mid] > nums[right]) {
if (target >= nums[left] && target < nums[mid]) {
right = mid - 1;
} else {
left = mid + 1;
}
} else {
right--;
}
}
return false;
}
本地测试
lay.showTitle(81);
Solution81 sol81 = new Solution81();
int[] nums81 = new int[]{2, 5, 6, 0, 0, 1, 2};
int target81 = 0;
System.out.println(Arrays.toString(nums81));
System.out.println(target81);
System.out.println(sol81.search(nums81, target81));