算法之二分查找问题详解

最新推荐文章于 2022-06-20 14:50:31 发布

一天学习一兜兜

最新推荐文章于 2022-06-20 14:50:31 发布

阅读量111

点赞数

分类专栏：算法 c++ 文章标签：算法 c++

本文链接：https://blog.csdn.net/q5c521/article/details/108303658

版权

c++ 同时被 2 个专栏收录

19 篇文章 0 订阅

订阅专栏

算法

3 篇文章 0 订阅

订阅专栏

文章目录

前言

二分查找：思路简单，细节是魔鬼。
它真的坑根本就是在于要mid加一还是减一，while里到底用 <=还是<。
讨论三个二分查找场景：寻找一个数，寻找左侧边界，寻找有右侧边界。

1. 二分查找框架

int binarySearch(vector<int> nums, int target) {
	int left = 0, right = ...;
	while (...) {
		// 有效的防止了mid的溢出
		int mid = left + (right - left) / 2;
		if (nums[mid] == target) {
			...
		} else if (nums[mid] > target) {
			right = ...
		} else if (nums[mid] < target) {
			left = ...
		}
	}
	return ...
}

2. 寻找一个数

int binarySearch (vector<int> nums, int target) {
	int left = 0;
	int right = nums.size() - 1;
	// 搜索区间是 [left，right]
	while (left <= right) {
		int mid = left + (right - left) / 2;
		if (nums[mid] == target)
			return mid;
		else if (nums[mid] > target)
			rgiht = mid - 1;
		else if (nums[mid] < target)
			left = mid + 1;
	}

	return -1;
}

3. 寻找左侧边界的二分搜索

// 每次循环的搜索区间是[left, right)
int binarySearch (vector<int> nums, int target) {
	if (nums.size() == 0)
		return -1;
	int left = 0;
	int right = nums.size();

	while (left < right) {
		int mid = left + (right - left) / 2;
		if (nums[mid] == target)
			right = mid;
		else if (nums[mid] > target)
			rgiht = mid;
		else if (nums[mid] < target)
			left = mid + 1;
	}

	return left;
}

int binarySearch (vector<int> nums, int target) {
	int left = 0;
	int right = nums.size() - 1;
	// 搜索区间为[left, right]
	while (left <= right) {
		int mid = left + (right - left) / 2;
		if (nums[mid] == target)
			// 收缩右侧边界
			right = mid - 1;
		else if (nums[mid] > target)
			// 搜索区间变为[left, mid - 1]
			rgiht = mid - 1;
		else if (nums[mid] < target)
			// 搜索区间变为[mid + 1, right]
			left = mid + 1;
	}
	// 检查出界情况
	if (left >= nums.size() || nums[left] != target)
		return -1;  
	return left;
}

4. 寻找右侧边界的二分搜索

// 每次循环的搜索区间是(left, right]
int binarySearch (vector<int> nums, int target) {
	if (nums.size() == 0)
		return -1;
	int left = 0;
	int right = nums.size();

	while (left < right) {
		int mid = left + (right - left) / 2;
		if (nums[mid] == target)
			left = mid + 1;
		else if (nums[mid] > target)
			rgiht = mid;
		else if (nums[mid] < target)
			left = mid + 1;
	}

	return left -1 ;
}

int binarySearch (vector<int> nums, int target) {
	int left = 0;
	int right = nums.size() - 1;
	// 搜索区间为[left, right]
	while (left <= right) {
		int mid = left + (right - left) / 2;
		if (nums[mid] == target)
			// 收缩左侧边界
			left = mid + 1;
		else if (nums[mid] > target)
			// 搜索区间变为[left, mid - 1]
			rgiht = mid - 1;
		else if (nums[mid] < target)
			// 搜索区间变为[mid + 1, right]
			left = mid + 1;
	}
	// 检查出界情况
	if (right < 0 || nums[right] != target)
		return -1;  
	return right;
}