https://www.cnblogs.com/luoxn28/p/5767571.html
在上面的博客里提到二分查找与其变种的原理,二分查找的模板如下:
int binSearch(vector<int> &a, int target) {
int left = 0;
int right = a.size()-1;
while (left <= right) {
int mid = (left + right) / 2;
if (a[mid] < target)
left = mid + 1;
else if (a[mid] > target)
right = mid - 1;
else
??? //(1)当a[mid] == target时,根据要求来确定,
}
return ?? //(2)根据要求来确定,
}
注意的是在while循环时,left <= right 是固定的
在(1) 和(2)处的代码,根据要求而变化
1、二分查找
对于简单的二分查找,也就是数组无重复元素,找到目标值在数组中的下标,否则返回-1
(1)处的代码为return mid;(2)处为return -1;
int binSearch(vector<int> &a, int target) {
int left = 0;
int right = a.size()-1;
while (left <= right) {
int mid = (left + right) / 2;
if (a[mid] < target)
left = mid + 1;
else if (a[mid] > target)
right = mid - 1;
else
return mid;
}
return -1;
}
2、二分查找的变种
由于退出循环后,right 一定会在 left 的左边,根据要求来决定当a[mid] == target时,到底是移动 right 还是移动 left,以及最终返回是right 还是 left。
2.1查找第一个与target相等的元素位置
退出循环后,left应该在重复元素区的最左边,即返回left,当a[mid] == target时,移动right,使rightl离开重复元素区
// 2.1查找第一个与target相等的元素位置
int findFirstEqual(vector<int> &a, int target) {
int left = 0;
int right = a.size() - 1;
while (left <= right) {
int mid = (left + right) / 2;
if (a[mid] > target)
right = mid - 1;
else if(a[mid] < target)
left = mid + 1;
else
right = mid - 1;
}
if (left < a.size() && a[left] == target)
return left;
else
return -1;
}
2.2查找最后一个与target相等的元素
同理,退出循环后,right 应该在重复元素区的最右边,即返回right,当a[mid] == target时,移动left,使 left 离开重复元素区
// 2.2查找最后一个与target相等的元素
int fingLastEqual(vector<int> &a, int target) {
int left = 0;
int right = a.size() - 1;
while (left <= right) {
int mid = (left + right) / 2;
if (a[mid] > target)
right = mid - 1;
else if (a[mid] < target)
left = mid + 1;
else
left = mid + 1;
}
if (right >= 0 && a[right] == target)
return right;
else
return -1;
}
2.3查找最后一个等于或者小于target的元素
这里假设需要查找的元素存在,即target 不会小于数组元素的最小值(下面都是基于查找元素存在)
right 应该在重复元素区的最右边,返回right
//2.3查找最后一个等于或者小于target的元素
int findLastEqualSmaller(vector<int> &a, int target) {
int left = 0;
int right = a.size() - 1;
while (left <= right) {
int mid = (left + right) / 2;
if (a[mid] > target)
right = mid - 1;
else if (a[mid] < target)
left = mid + 1;
else
left = mid + 1;
}
return right;
}
2.4查找最后一个小于target的元素
left 应该在重复元素区的最左边,返回 right
//2.4查找最后一个小于target的元素
int findLastSmaller(vector<int> &a, int target) {
int left = 0;
int right = a.size() - 1;
while (left <= right) {
int mid = (left + right) / 2;
if (a[mid] > target)
right = mid - 1;
else if (a[mid] < target)
left = mid + 1;
else
right = mid -1;
}
return right;
}
2.5查找第一个等于或者大于target的元素
right 应该在重复元素区的最右边,返回 left
// 2.5查找第一个等于或者大于target的元素
int findFirrtEqualLarger(vector<int> &a, int target) {
int left = 0;
int right = a.size() - 1;
while (left <= right) {
int mid = (left + right) / 2;
if (a[mid] > target)
right = mid - 1;
else if (a[mid] < target)
left = mid + 1;
else
right = mid - 1;
}
return left;
}
2.6查找第一个大于target的元素
left 应该在重复元素区的最左边,返回 left
// 2.6查找第一个大于target的元素
int findFirstLarger(vector<int> &a, int target) {
int left = 0;
int right = a.size() - 1;
while (left <= right) {
int mid = (left + right) / 2;
if (a[mid] > target)
right = mid - 1;
else if (a[mid] < target)
left = mid + 1;
else
left = mid + 1;
}
return left;
}