题目链接:704.二分查找
版本一:左闭右开
class Solution {
public:
int search(vector<int>& nums, int target) {
int left = 0;
int right = nums.size();
while (left < right) {
int middle = (left + right) / 2;
if (nums[middle] < target) {
left = middle + 1;
}else if (nums[middle] > target) {
right = middle;
}else {
return middle;
}
}
return -1;
}
};
版本二:左闭右闭
class Solution {
public:
int search(vector<int>& nums, int target) {
int left = 0;
int right = nums.size() - 1;
while (left <= right) {
int middle = (left + right) / 2;
if (nums[middle] < target) {
left = middle + 1;
}else if (nums[middle] > target) {
right = middle - 1;
}else {
return middle;
}
}
return -1;
}
};
心得体会
主要是理解搜索target的过程中搜索区间的区别,如果搜索区间为[left,right],则在循环过程中设定循环条件为left <= right,因为left == right时有意义,同时需要设定初始right为nums.size() - 1
如果搜索区间为[left,right),则在循环过程中设定循环条件为left < right,因为left == right时没有意义,那么为了不丢失搜寻元素,初始right为nums.size()
题目链接:35.搜索插入位置
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int left = 0;
int right = nums.size();
while (left < right) {
int middle = (left + right) / 2;
if (nums[middle] < target) {
left = middle + 1;
}else if (nums[middle] > target) {
right = middle;
}else {
return middle;
}
}
return right;
}
};
心得体会
这里我在草稿纸上举例验算使用哪种版本的二分法,开始尝试左闭右开的版本,发现插入位置就是右指针所在位置,非常方便。那么类似地,左闭右闭的版本返回值要+1
题目链接:27.移除元素
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int slow = 0;
for (int fast = 0; fast < nums.size(); fast++) {
if (nums[fast] != val) {
nums[slow++] = nums[fast];
}
}
return slow;
}
};
心得体会
理解快慢指针的作用。其中快指针是遍历整个数组,慢指针用来记录符合条件的值。当快指针找到不是val的值时,将这个值交给慢指针所在的位置,同时慢指针向后移动一位,最终快指针遍历完数组,慢指针就是最后的非val的数组元素个数。
题目链接:34.在排序数组中查找元素的第一个和最后一个位置
在刚上手尝试这道题,我首先写出了这样的代码:
class Solution {
public:
vector<int> searchRange(vector<int>& nums, int target) {
int left = 0;
int right = nums.size() - 1;
while (left <= right) {
int middle = (left + right) / 2;
if (nums[middle] < target) {
left = middle + 1;
}else if (nums[middle] > target) {
right = middle - 1;
}else {
if (nums[middle + 1] == target) {
return vector<int> {middle, middle + 1};
}else {
return vector<int> {middle - 1,middle};
}
}
}
return vector<int> {-1, -1};
}
};
这个题目本身的测试用例是直接通过了,我一阵惊喜涌上大脑:难道我真的是天才?这时发现测试通过不了,在看了一下测试用例,发现是少考虑了很多情况。重振旗鼓后,我参考标准答案(代码随想录)写出这样的代码:
class Solution {
public:
vector<int> searchRange(vector<int>& nums, int target) {
int r = getR(nums, target);
int l = getL(nums, target);
if (l == -2 || r == -2) return {-1, -1};
if ((r - l) > 1) return {l + 1, r - 1};
return {-1, -1};
}
private:
int getR(vector<int>& nums, int target) {
int left = 0;
int right = nums.size() - 1;
int r = -2;
while (left <= right) {
int middle = (left + right) / 2;
if (nums[middle] > target) {
right = middle - 1;
}else {
left = middle + 1;
r = left;
}
}
return r;
}
int getL(vector<int>& nums, int target) {
int left = 0;
int right = nums.size() - 1;
int l = -2;
while (left <= right) {
int middle = (left + right) / 2;
if (nums[middle] < target) {
left = middle + 1;
}else {
right = middle - 1;
l = right;
}
}
return l;
}
};
心得体会
本题关键在于考虑清楚所有的情况,同时应当把解题思路放在二分查找左右边界。