LeetCode704 二分查找:
1.定义target在一个左闭右闭的区间,即[left,right];
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;
}
};
//时间复杂度:O(log n)
//空间复杂度:O(1)
2.定义target在一个左闭右开的区间,即[left,right);
class Solution {
public:
int search(vector<int>& nums, int target) {
int left = 0;
int right = nums.size();
while(left < right){
int middle = left + ((right - left) >> 1);
if (nums[middle] > target){
right = middle;
}else if (nums[middle] < target){
left = middle + 1;
}else {
return middle;
}
}
return -1;
}
};
//时间复杂度:O(log n)
//空间复杂度:O(1)
LeetCode27 移除元素:
1.暴力解法:
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int size = nums.size();
for (int i = 0; i < size; i++){
if (nums[i] == val){
for (int j = i + 1; j < size; j++){
nums[j - 1] = nums[j];
}
i--;/*因为i下标的元素都向前移动了一位,所以i也要向前移动一位,比如需要移除元素的值为3,此时nums[2] = 3被nums[3] = 3所覆盖了,此时nums[2]的值还是等于3,所以还得重新判断i = 2位置时是否要移除元素,不让继续循环后i++,i就等于3了,所以i要先--,然后++,才能在原来的位置。*/
size--;
}
}
return size;
}
};
//时间复杂度:O(n^2)
//空间复杂度:O(1)
2.双指针(快慢指针):
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int slowIndex = 0;
for (int fastIndex = 0; fastIndex < nums.size(); fastIndex++){
if (val != nums[fastIndex]){//当快指针碰到val时,快指针跳过val,执行++,慢指针不动,相当于错开了一位,随后执行赋值相当于把数组往前移了一位
nums[slowIndex++] = nums[fastIndex];
}
}
return slowIndex;
}
};
//时间复杂度:O(n)
//空间复杂度:O(1)