刷题日记

合并两个有序数组
https://leetcode.cn/problems/merge-sorted-array/description/?envType=study-plan-v2&envId=top-interview-150
public static void merge (int[] nums1, int m, int[] nums2, int n) {
int index = m + n - 1;
int p1 = m - 1;
int p2 = n - 1;

 while (p1 >= 0 || p2 >= 0) {
     if (p1 == -1) {
         nums1[index] = nums2[p2--];
     } else if (p2 == -1) {
         nums1[index] = nums1[p1--];
     } else if (nums1[p1] >= nums2[p2]) {
         nums1[index] = nums1[p1--];
     } else {
         nums1[index] = nums2[p2--];
     }
     index--;
 }

}

移除元素
https://leetcode.cn/problems/remove-element/description/?envType=study-plan-v2&envId=top-interview-150
public int removeElement(int[] nums, int val) {
int left = 0;
int n = nums.length;
for (int right = 0; right < n; right++) {
if (nums[right] != val) {
nums[left] = nums[right];
left++;
}
}

 return left;

}