前言
文章来自原文
Knuth 大佬(发明 KMP 算法的那位)曾说:
Although the basic idea of binary search is comparatively straightforward,
the details can be surprisingly tricky…
这句话可以这样理解:思路很简单,细节是魔鬼。
一、二分查找框架
int binarySearch(int[] nums, int target) {
int left = 0, right = ...;
while(...) {
int mid = (right + left) / 2;
if (nums[mid] == target) {
...
} else if (nums[mid] < target) {
left = ...
} else if (nums[mid] > target) {
right = ...
}
}
return ...;
}
二、二分查找(基本二分搜索)
int binarySearch(int[] nums, int target) {
int left = 0;
int right = nums.length - 1; // 注意
while(left <= right) {
int mid = (right + left) / 2;
if(nums[mid] == target)
return mid;
else if (nums[mid] < target)
left = mid + 1; // 注意
else if (nums[mid] > target)
right = mid - 1; // 注意
}
return -1;
}
三、寻找左边界
int left_bound(int[] nums, int target) {
if (nums.length == 0) return -1;
int left = 0;
int right = nums.length; // 注意
while (left < right) { // 注意
int mid = (left + right) / 2;
if (nums[mid] == target) {
right = mid;
} else if (nums[mid] < target) {
left = mid + 1;
} else if (nums[mid] > target) {
right = mid; // 注意
}
}
return left;
}
四、寻找右边界
int right_bound(int[] nums, int target) {
if (nums.length == 0) return -1;
int left = 0, right = nums.length;
while (left < right) {
int mid = (left + right) / 2;
if (nums[mid] == target) {
left = mid + 1; // 注意
} else if (nums[mid] < target) {
left = mid + 1;
} else if (nums[mid] > target) {
right = mid;
}
}
return left - 1; // 注意
}
五、细节详解
- 跳出循环的原因:mid = (left + right) / 2;是下取整,所以left = mid + 1才能保证不陷入死循环。
- 不用mid = (right + left +1) / 2的原因:上取整可能导致数组越界
- 查找左右边界的时候,初始化right = nums.size()保证进入right>left循环里。
- 查找左边界就是当 target == nums[mid]时,不断地缩小右边,最后找到唯一的值就是左边界。
- 查找右边界的时候不断所有左边的区间,最后达到唯一。
https://leetcode.cn/problems/median-of-two-sorted-arrays/
https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/
写完基本就会二分查找了!