代码随想录算法训练营第一天 | 704. 二分查找 27. 移除元素
题目
一、力扣704. 二分查找
思路:注意边界条件,左闭右闭,左闭右开
class Solution {
public int removeElement(int[] nums, int val) {
int slow = 0;
for (int fast = 0; fast < nums.length; fast++) {
if (nums[fast] != val) {
nums[slow] = nums[fast];
slow++;
}
}
return slow;
}
}
二、力扣27. 移除元素
题目链接
思路:快慢指针法
class Solution {
public int search(int[] nums, int target) {
int left = 0, right = nums.length - 1, mid;
while (left <= right) {
mid = (left + right) / 2;
if (nums[mid] < target){
left = mid + 1;
} else if (nums[mid] > target) {
right = mid - 1;
} else {
return mid;
}
}
return -1;
}
}