leetcode 88.合并两个有序数组

public class ll {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int m = scanner.nextInt();
        int n = scanner.nextInt();

        int[] a = new int[n + 1];
        int[] b = new int[m + 1];
        int[] c = new int[m + n + 1];

        for (int i = 1; i <= m; i++) {
            b[i] = scanner.nextInt();
        }
        for (int i = 1; i <= n; i++) {
            a[i] = scanner.nextInt();
        }

        int l = 1, r = 1, j = 0;
        while (l <= m && r <= n) {
            if (b[l] < a[r]) {
                c[++j] = b[l++];
            } else {
                c[++j] = a[r++];
            }
        }

        while (l <= m) {
            c[++j] = b[l++];
        }
        while (r <= n) {
            c[++j] = a[r++];
        }

        for (int i = 1; i <= n + m; i++) {
            System.out.print(c[i] + " ");
        }
    }

    //从最后面填充数组nums1，保证nums1前面的数据不会被覆盖
    public void merge(int[] nums1, int m, int[] nums2, int n) {
    int i = m - 1;
    int j = n - 1;
    int k = m + n - 1;

    while (i >= 0 && j >= 0) {
        if (nums1[i] > nums2[j]) {
            nums1[k--] = nums1[i--];
        } else {
            nums1[k--] = nums2[j--];
        }
    }

    // 将 nums2 中剩余的元素复制到 nums1 中
    while (j >= 0) {
        nums1[k--] = nums2[j--];
    }
}

}