题目链接:
704题 二分查找
public class Num704 {
public static void main(String[] args) {
int[] nums = new int[]{-1, 0, 3, 5, 9, 12};
int target = 9;
int search = Binarysearch1(nums, target);
System.out.println(search);
}
/**
* 左闭右闭
*/
public static int Binarysearch1(int[] nums, int target) {
// 避免当 target 小于nums[0] nums[nums.length - 1]时多次循环运算
if (target < nums[0] || target > nums[nums.length - 1]) {
return -1;
}
int left = 0, right = nums.length - 1;
while (left <= right) {
int mid = left + ((right - left) >> 1);
System.out.println("mid - " + mid);
if (nums[mid] == target)
return mid;
else if (nums[mid] < target)
left = mid + 1;
else if (nums[mid] > target)
right = mid - 1;
}
return -1;
}
/**
左闭右开
*/
public int Binarysearch2(int[] nums, int target) {
int left = 0, right = nums.length;
while (left < right) {
int mid = left + ((right - left) >> 1);
if (nums[mid] == target)
return mid;
else if (nums[mid] < target)
left = mid + 1;
else if (nums[mid] > target)
right = mid;
}
return -1;
}
}
题目链接:
27题 移除元素
public class Num27 {
public static void main(String[] args) {
int[] nums = new int[]{0, 1, 2, 2, 3, 0, 4, 2};
int val = 2;
int ele = removeElement2(nums, val);
System.out.println("数组长度 " + ele);
for (int i = 0; i < nums.length; i++) {
System.out.println(nums[i]);
}
}
// 暴力破解 O(n^2)
public static int removeElement1(int[] nums, int val) {
int size = nums.length;
for (int i = 0; i < size; i++) {
if (nums[i] == val) {
//删除数据,后续数据依此前移
for (int j = i +1; j < size; j++) {
nums[j-1] = nums[j];
}
i--;
size--;
}
}
return size;
}
// 双指针法 (不改变元素位置)
public static int removeElement2(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;
}
// 双指针法 (可以改变元素位置)
public int removeElement3(int[] nums, int val) {
int left = 0;
int right = nums.length - 1;
while(right >= 0 && nums[right] == val) right--; //将right移到从右数第一个值不为val的位置
while(left <= right) {
if(nums[left] == val) { //left位置的元素需要移除
//将right位置的元素移到left(覆盖),right位置移除
nums[left] = nums[right];
right--;
}
left++;
while(right >= 0 && nums[right] == val) right--;
}
return left;
}
}