代码训练营day1--704.二分查找|27.移除元素

704.二分查找
class Solution {
public:
int search(vector& nums, int target) {
int left = 0;
int right = nums.size() - 1;
while (left <= right) {
int mid = left + (right - left) / 2;
if (nums[mid] < target) {
left = mid + 1;
} else if (nums[mid] > target) {
right = mid - 1;
} else {
return mid;
}
}
return nums[left] == target ? left : -1

27.移除元素
class Solution {
public:
int removeElement(vector& nums, int val) {
if (nums.empty()) {
return 0;
}
int left = 0;
int right = nums.size() - 1;
while (left < right) {
if (nums[left] != val) {
left++;
continue;
}
if (nums[right] == val) {
right–;
continue;
}
int temp = nums[left];
nums[left] = nums[right];
nums[right] = temp;
left++;
right–;
}
return nums[left] == val ? left : left + 1;
}
};