1. 实现及特性
前提
- 目标函数单调性(有序)
- 存在上下界(bounded)
- 能够通过索引访问(index accessible)
代码模板
注意
2 算法题解
在这里插入代码片
class Solution {
public int search(int[] nums, int target) {
int left = 0;
int right = nums.length - 1;
int mid = left + (right - left) / 2;
while (left <= right) {
if (nums[mid] == target) return mid;
if (nums[left] <= nums[mid]) {
if (target >= nums[left] && target <= nums[mid]) {right = mid - 1;}
else left = mid + 1;
}
else {
if (target >= nums[mid] && target <= nums[right]) {left = mid + 1;}
else right = mid - 1;
}
mid = left + (right - left) / 2;
}
return -1;
}
}