Leetcode 704二分查找 27移除元素
704: https://leetcode.cn/problems/binary-search/
27: https://leetcode.cn/problems/remove-element/submissions/551334854/
704
复习了二分边界
class Solution {
public:
int search(vector<int>& nums, int target) {
int left = 0, right = nums.size() - 1, mid = 0;
while (left <= right) {
mid = left + (right - left) / 2;
if (nums[mid] < target) {
left = mid + 1;
} else if (nums[mid] > target) {
right = mid - 1;
} else {
return mid;
}
}
return -1;
}
};
27
用了while, 感觉有点复杂, 没那么简洁, 但是感觉更容易看懂
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int slow = 0, fast = 0;
while (fast < nums.size()) {
if (nums[fast] != val) {
nums[slow] = nums[fast];
slow++;
fast++;
} else {
fast++;
}
}
return slow;
}
};