704 二分查找
- 适用该算法的场景
- 有序数组
- 在数组中找某个值
- 代码:
class Solution {
public int search(int[] nums, int target) {
int left = 0;
int right = nums.length; // right没有意义
while (left < right) { // 注意此处比较
int middle = left + (right - left) / 2;
if (nums[middle] < target) {
left = middle + 1;
} else if (nums[middle] > target) {
right = middle; // 注意此处
} else {
return middle;
}
}
return -1;
}
}
class Solution {
public int search(int[] nums, int target) {
int left = 0;
int right = nums.length - 1; // right是一个需要比较的数
while (left <= right) { // 注意此处比较
int middle = left + (right - left) / 2;
if (nums[middle] < target) {
left = middle + 1;
} else if (nums[middle] > target) {
right = middle - 1; // 保证right部分有意义
} else {
return middle;
}
}
return -1;
}
}
note
:明确区间边界的定义,选用[left, right]
还是[left, right)
意义不同
27 移除数据
代码如下:
class Solution {
public int removeElement(int[] nums, int val) {
int left = 0, right = 0;
while (right < nums.length) {
// 两个都不相等,指针都往后走一个
if (nums[right] != val && nums[left] != val) {
nums[left] = nums[right];
right++;
left++;
continue;
}
// 当两个都相等时,右指针找不相等的数
if (nums[right] == val && nums[left] == val) {
right++;
continue;
}
// 当右指针找到不相等的数的时候,赋值并往后走一位
if (nums[right] != val && nums[left] == val) {
nums[left] = nums[right];
left++;
right++;
continue;
}
// 当右指针找到相等的数,继续往后走,直到找到不相等的数
if (nums[right] == val && nums[left] != val) {
right++;
continue;
}
}
return nums.length - (right - left);
}
}
// 上述进行简化
class Solution {
public int removeElement(int[] nums, int val) {
int left = 0, right = 0;
while (right < nums.length) {
if (nums[right] != val) {
nums[left] = nums[right];
right++;
left++;
continue;
}
if (nums[right] == val) {
right++;
continue;
}
}
return nums.length - (right - left);
}
}
代码随想录的写法:
class Solution {
public int removeElement(int[] nums, int val) {
// 快慢指针
int slowIndex = 0;
for (int fastIndex = 0; fastIndex < nums.length; fastIndex++) {
if (nums[fastIndex] != val) {
nums[slowIndex] = nums[fastIndex];
slowIndex++;
}
}
return slowIndex;
}
}
note
:需要想明白快慢指针的意义
977 有序数组的排序
代码:
class Solution {
public int[] sortedSquares(int[] nums) {
int left = 0;
int right = nums.length - 1;
int index = nums.length - 1;
int[] res = new int[nums.length];
while(left <= right) {
if (Math.abs(nums[left]) > Math.abs(nums[right])) {
res[index--] = nums[left] * nums[left];
left++;
} else {
res[index--] = nums[right] * nums[right];
right--;
}
}
return res;
}
}