代码随想录算法训练营第1天| 704. 二分查找 、 27. 移除元素
704.二分查找
有序数组(本题是有序),查找问题,可以使用二分查找,降低时间复杂度,本题使用的内部构造是左闭右闭区间。
class Solution {
public:
int search(vector<int>& nums, int target) {
int left = 0, right = nums.size() - 1, mid = 0;
while (left <= right) {
//预防越界
int mid = left + (right -left) / 2;
if (nums[mid] == target) {
return mid;
} else if (nums[mid] > target) {
right = mid - 1;
} else if (nums[mid] < target) {
left = mid + 1;
}
}
return -1; // not found;
}
};
27. 移除元素
第一个想到的就是暴力解法,两层的遍历,第一层是比较是否找到了目标元素,第二个循环就是循环移位。
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];
}
// after an element deleted, need to update the value of i;
i--;
size--;
}
}
return size;
}
};
第二个想到的就是使用双指针(快慢指针),题目要求是元素的相对顺序可以改变。因此又有两个变化,一个是相对顺序不改变,另一个就是相对顺序可以改变。
// do not consider keep the relative order
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int size = nums.size();
int left = 0, right = size - 1;
while (left <= right) {
// find the target which is target from the left
while (nums[left] != val && left <= right) {
++left;
}
// to find the value which is not the target from the right
while (nums[right] == val && left <= right) {
--right;
}
// to swap the value of two target
if (left < right) {
nums[left] = nums[right];
left++;
right--;
}
}
// left is pointed to the next value of the end of the array
return left;
}
};
// to consider the relative order
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int slow = 0, fast = 0, size = nums.size();
while (fast < size) {
if (nums[fast] == val) {
fast++;
} else {
nums[slow] = nums[fast];
slow++;
fast++;
}
}
return slow;
}
};