704.二分查找
思路:
这一题主要解决的问题是二分查找时的范围开闭
通常采用的做法是左闭右闭和左闭右开(即[l, r]和[l, r))
class Solution { //左闭右闭
public int search(int[] nums, int target) {
int left = 0;
int right = nums.length - 1;
while (left <= right) {
int middle = (left + right) / 2;
if (nums[middle] > target) {
right = middle - 1;
} else if (nums[middle] < target) {
left = middle + 1;
} else {
return middle;
}
}
return -1;
}
}
class Solution { //左闭右开
public int search(int[] nums, int target) {
int left = 0;
int right = nums.length;
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;
}
}
二者的代码逻辑基本相同,差距主要在几个等号处
- right的初始化:左闭右闭的right取值为nums.length - 1,左闭右开的right取值为nums.length
- 循环条件:左闭右闭的循环条件为left<=right,因为区间即使为[1,1]也符合条件;左闭右开的条件为left<right,[1,1)显然是错误的
- 循环中left与right的取值:需要根据能否取到边界值而判断
27.移除元素
暴力法:
class Solution {
public int removeElement(int[] nums, int val) {
int len = nums.length;
for (int i = 0; i < len; i++) {
//System.out.println(Arrays.toString(nums));
if (nums[i] == val) {
for (int j = i; j < len - 1; j++) {
nums[j] = nums[j + 1];
}
i--;
len--;
}
}
return len;
}
}
需要注意的有两点
- for循环的条件是i < len而不是i < nums.length
- 如果nums[i] == val,需要在最后将i–,否则会少判断一个数字
双指针法:
class Solution {
public int removeElement(int[] nums, int val) {
int fast = 0, slow = 0;
for (; fast < nums.length; fast++) {
if (nums[fast] != val) {
nums[slow++] = nums[fast];
}
}
return slow;
}
}
主要要理解快慢指针的思想