虽然二分查找思路很简单,但实现起来需要注意很多细节。如区间是闭合区间还是前开后闭区间,循环的退出条件是left < right 还是 left <= right,下一步搜索是使用mid还是mid+1等。
普通二分查找
// 普通二分查找、递归
int binary_search(const vector<int>& nums, const int& target, int start, int end)
{
if (start >= end) return -1;
int mid = (start + end) >> 1;
if (nums[mid] == target) return mid;
if (nums[mid] > target) return binary_search(nums, target, start, mid);
if (nums[mid] < target) return binary_search(nums, target, mid + 1, end);
return -1;
}
二分查找,返回左端位置
// 二分查找,返回左端位置
int binary_search_left(const vector<int>& nums, const int& target)
{
int left = 0, right = nums.size(); // 采取左开右闭的搜索区间
while(left < right)
{
int mid = (left + right) >> 1;
if(nums[mid] == target)
right = mid; // 继续向左侧查找
else if(nums[mid] < target)
left = mid + 1;
else if(nums[mid] > target)
right = mid;
}// 退出循环时,left == right
if(left == nums.size()) return -1;
return nums[left]==target ? left : -1;
}
二分查找,返回右端位置
// 二分查找,返回右端位置
int binary_search_right(const vector<int>& nums, const int& target)
{
int left = 0, right = nums.size(); // 采取左开右闭的搜索区间
while(left < right)
{
int mid = (left + right) >> 1;
if(nums[mid] == target)
left = mid + 1; // 继续向右侧查找
else if(nums[mid] < target)
left = mid + 1;
else if(nums[mid] > target)
right = mid;
}// 退出循环时,left == right
if(left == 0) return -1;
return nums[left-1] == target ? left-1 : -1;
}