二分查找的关键点:
while循环什么时候终止
对于左闭右闭区间,即[left, right],应是while(left <= right) {},最简单理解,在左右闭区间中,left是可以等于right的,故可取 “<=”;
对于左闭右开区间,即[left, right),应是while(left < right) {},最简单理解,在左右开区间中,left不可以等于right,若等于会导致区间定义矛盾,故取 “<”;
middle、right、left的取值
对于middle,相较于middle=(left+right)/2,选择middle = left + ((right-left)/2)更合适,可以防止越界;
对于right,左闭右闭区间下,right=middle-1,因为右闭,nums[middle] > target的话,索引只能取左移的一个;左闭右开区间下,right=middle;
对于left,只能是left=middle+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-left)/2); //防止越界
if(nums[middle] > target) {
right = middle - 1;
}
else if(nums[middle] < target) {
left = middle + 1;
}
else {
return middle;
}
}
return -1;
}
};
class Solution(object):
def search(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: int
"""
left, right = 0, len(nums)-1
while left <= right :
middle = left + (right - left) // 2
if nums[middle] > target :
right = middle - 1
elif nums[middle] < target :
left = middle + 1
else :
return middle
return -1
双指针法的关键点:(个人更偏向于叫快慢idx)
慢指针——s_idx 快指针——f_idx
f_idx指向的值是满足 if(nums[f_idx] != val) 条件后,要填入到新数组的值;而s_idx是新数组中新元素对应的idx。
比喻:nums[f_idx]是好萝卜或坏萝卜,然后,有一个好萝卜,就挖一个s_idx的坑,把好萝卜埋进去。
根据题目,不必新建数组,直接覆盖原数组即可。
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int s_idx= 0;
for(int f_idx=0; f_idx < nums.size(); f_idx++) {
if(nums[f_idx] != val) {
nums[s_idx] = nums[f_idx];
s_idx++;
}
}
return s_idx;
}
};
class Solution(object):
def removeElement(self, nums, val):
"""
:type nums: List[int]
:type val: int
:rtype: int
"""
s_idx = 0
for f_idx in range(0, len(nums)) :
if nums[f_idx] != val :
nums[s_idx] = nums[f_idx]
s_idx += 1
return s_idx