704查找数组内特定值704. 二分查找 - 力扣(LeetCode)
1. [l,r]
while(l<=r){
int middle=(l+r)/2;
if(target<nums[middle]){
r=middle-1;
}else if(target>nums[middle]){
l=middle+1;
}else{
return middle;
}
}
return -1;
2. [l,r)
int l=0,r=len;
while(l<r){
int middle=(l+r)/2;
if(target<nums[middle]){
r=middle;
}else if(target>nums[middle]){
l=middle+1;
}else{
return middle;
}
}
27.移除元素27. 移除元素 - 力扣(LeetCode)
erase()是o(n)方法
快慢指针
int n = nums.size();
int left = 0;
for (int right = 0; right < n; right++) {
if (nums[right] != val) {
nums[left] = nums[right];
left++;
}
}
return left;