LeetCode704. 二分查找
题目链接:704. 二分查找
方法一:二分(左闭右闭)
$时间复杂度O()空间复杂度O(1)
class Solution {
public:
int search(vector<int>& nums, int target) {
int l = 0, r = nums.size() - 1;
while(l <= r) {
int mid = l + ((r - l) >> 1);
if(nums[mid] > target) {
r = mid - 1;
}else if(nums[mid] < target) {
l = mid + 1;
}else {
return mid;
}
}
return -1;
}
};
方法二:二分(左闭右开)
$时间复杂度O()空间复杂度O(1)
class Solution {
public:
int search(vector<int>& nums, int target) {
int l = 0, r = nums.size();
while(l < r) {
int mid = l+((r-l)>>1);
if(nums[mid] > target) r = mid;
else if(nums[mid] < target) l = mid+1;
else return mid;
}
return -1;
}
};
LeetCode35. 搜索插入位置
方法:二分
$时间复杂度O()空间复杂度O(1)
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int l = 0, r = nums.size()-1;
int res = nums.size();
while(l <= r) {
int mid = l + ((r-l) >> 1);
if(nums[mid] >= target) {
res = mid;
r = mid-1;
}else l = mid+1;
}
return res;
}
};
LeetCode34. 在排序数组中查找元素的第一个和最后一个位置
方法:二分
$时间复杂度O()空间复杂度O(1)
class Solution {
private:
int getR(vector<int>& nums, int target) {
int rval = -2, l = 0, r = nums.size()-1;
while(l <= r) {
int mid = l+((r-l)>>1);
if(nums[mid] > target) r = mid-1;
else {
l = mid+1;
rval = l;
}
}
return rval;
}
int getL(vector<int>& nums, int target) {
int lval = -2, l = 0, r = nums.size()-1;
while(l <= r) {
int mid = l+((r-l)>>1);
if(nums[mid] < target) l = mid+1;
else {
r = mid-1;
lval = r;
}
}
return lval;
}
public:
vector<int> searchRange(vector<int>& nums, int target) {
int lidx = getL(nums, target), ridx = getR(nums, target);
if(lidx == -2 || ridx == -2) return {-1, -1};
if(ridx-lidx > 1) return {lidx+1, ridx-1};
return {-1, -1};
}
};
LeetCode27. 移除元素
方法:双指针
$时间复杂度O(n)空间复杂度O(1)
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int l = 0, r = 0;
for(r = 0; r < nums.size(); ++r) if(val != nums[r]) nums[l++] = nums[r];
return l;
}
};