/*有参考教学视频官网题解 整完思路与官方代码再自己敲的*/
数理基础 : 数组连续存储 只可覆盖不可删除
二分法 时间复杂度 O(logN) 空间复杂度O(1)
比较次数 :
#单调数组搜索target
1.根据区间开闭设置合法判断条件
while()if()不设置等号时可将左右端点各向内推一位减少比较次数
2.比较nums[mid]与target变换端点
3.确定target位置
/*return为什么不会被后面的覆盖掉
return 表示函数的结束 取首次值后结束*/
class Solution {
public:
int search(vector<int>& nums, int target) {
int left = 0, right = nums. size() - 1;
while(left <= right) {
int mid = (left+right)/2;
if(nums[mid] < target){
left = mid+1;
}
else if(nums[mid]>target){
right = mid-1;
}
else{
return mid;
}
}
return -1;
}
};
%target可能不存在于现有数组%
1.存在二分查找返回mid
2.反之二分查找返回(nums[mid] > target)->(mid)
target下一位的数字即为target位置 递增情况
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int left = 0, right = nums. size() - 1;
int ans = nums. size();
while (left <= right){
int mid = (left + right)/2;
if (nums[mid] >= target) {
right = mid -1;
ans = mid;
}
else if (nums[mid] < target){
left = mid + 1;
}
}
return ans;
}
};
%存在多个target搜索区间%
vector<int>{}同时保留多个数据
1.确定第一次出现等于target位置
2.确定第一次出现大于target位置
***设置bool设置等号成立
ture -> leftIdx
false -> rightIdx
or return vector<int>{-1,-1}
class Solution {
public:
int binarySearch(vector<int>& nums, int target, bool lower) {
int left = 0, right = (int) nums. size() - 1, ans = (int) nums. size();
while (left <= right) {
int mid = (left + right) / 2;
if((nums[mid] > target) || (nums[mid] >= target && lower)) {
right = mid - 1;
ans = mid;
} else {
left = mid + 1;
}
}
return ans;
}
vector<int> searchRange(vector<int>& nums, int target) {
int leftIdx = binarySearch(nums, target, true);
int rightIdx = binarySearch(nums, target, false) - 1;
if(leftIdx <= rightIdx && rightIdx <= nums. size()-1 && nums[leftIdx] == target && nums[rightIdx] == target) {
return vector<int>{leftIdx, rightIdx};
}
return vector<int>{-1, -1};
}
};
%删除符合target的数字返回数组长度%
双指针法->新开数组存储
if(nums[right] != val){
nums[left] = nums[right];
left++;
}
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
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;
}
};