二分查找小结
从这周的习题和每日一题来看,二分查找虽然思想简单,但变体众多,且极易出错。因此,小结以求避坑。
先给出二分查找模板(C++):
int low = 0;
int high = n - 1;
while (low <= high) {
int mid = low + ((high - low) >> 1);//简洁位运算形式可加速
if (a[mid] == value) {
return mid;
} else if (a[mid] < value) {
low = mid + 1;
} else {
high = mid - 1;
}
}
其中,关键有三点:
-
循环退出条件是 low <= high,而不是 low < high
-
mid取值,用位运算形式加速,即模板中所示
-
low 和 high 的更新
至于变体形式,目前所遇到的情况,基本是在如何更新low和high,及在更新的同时完成目标任务上下功夫。这些题目应该是可以直接套用二分查找模板的,当然这样可能会啰嗦些,不过也是很好的训练机会。
再者,什么时候可以用二分查找呢?
大抵以下几点要求:
- 依靠顺序表结构实现,且最好是数组(链表的话效率太低)
- 针对的一定是有序数据(起码得是半有序吧)
- 更适合处理静态数据,无频繁插入删除为佳
最后,给出四个常用变体形式:
//变体一:查找第一个值等于给定值的元素
public int bsearch(int[] a, int n, int value) {
int low = 0;
int high = n - 1;
while (low <= high) {
int mid = low + ((high - low) >> 1);
if (a[mid] > value) {
high = mid - 1;
} else if (a[mid] < value) {
low = mid + 1;
} else {
if ((mid == 0) || (a[mid - 1] != value)) return mid;
else high = mid - 1;
}
}
return -1;
}
//变体二:查找最后一个值等于给定值的元素
public int bsearch(int[] a, int n, int value) {
int low = 0;
int high = n - 1;
while (low <= high) {
int mid = low + ((high - low) >> 1);
if (a[mid] > value) {
high = mid - 1;
} else if (a[mid] < value) {
low = mid + 1;
} else {
if ((mid == n - 1) || (a[mid + 1] != value)) return mid;
else low = mid + 1;
}
}
return -1;
}
//变体三:查找第一个大于等于给定值的元素
public int bsearch(int[] a, int n, int value) {
int low = 0;
int high = n - 1;
while (low <= high) {
int mid = low + ((high - low) >> 1);
if (a[mid] >= value) {
if ((mid == 0) || (a[mid - 1] < value)) return mid;
else high = mid - 1;
} else {
low = mid + 1;
}
}
return -1;
}
//变体四:查找最后一个小于等于给定值的元素
public int bsearch7(int[] a, int n, int value) {
int low = 0;
int high = n - 1;
while (low <= high) {
int mid = low + ((high - low) >> 1);
if (a[mid] > value) {
high = mid - 1;
} else {
if ((mid == n - 1) || (a[mid + 1] > value)) return mid;
else low = mid + 1;
}
}
return -1;
}
附一个思考题:使用二分查找,寻找一个半有序数组 [4, 5, 6, 7, 0, 1, 2] 中间无序的地方
//假定为升序排列且无重复元素,这个问题其实和LeetCode 153题(寻找旋转排序数组中的最小值)类似
//找出最小元素所在下标,若下标不为0(即非有序数组),则该下标往后直至数组末尾都是无序
class Solution {
public:
int findMin(vector<int>& nums) {//找最小元素下标
int low = 0;
int high = nums.size() - 1;
int min_num = nums[low];
int min_index = low;
while (low <= high) {
int mid = low + ((high - low) >> 1);
if (nums[mid] > nums[low]) {//左半部分有序
if (min_num < nums[low]) {
min_index = low;
min_num = nums[low];
}
low = mid + 1;
}
else if (nums[mid] < nums[low]){//右半部分有序
if (min_num < nums[mid]) {
min_index = mid;
min_num = nums[mid];
}
high = mid - 1;
}
else {//此时,只剩nums[low]和nums[high]未比较
if (min_num < nums[low]) {
min_index = low;
min_num = nums[low];
}
if (min_num < nums[high]) {
min_index = high;
min_num = nums[high];
}
break;
}
}
return min_index;
}
};