【大厂高频算法题】合并两个有序数组

class Solution {
    public void merge(int[] a, int m, int[] b, int n) {
        int[] c = new int[m + n];
        int i = 0, j = 0, k = 0;

        // a，b数组都有元素时
        while (i < m && j < n) {
            if (a[i] < b[j]) {
                c[k++] = a[i++];
            } else {
                c[k++] = b[j++];
            }
        }

        // 若a有剩余
        while (i < m) {
            c[k++] = a[i++];
        }

        // 若b有剩余
        while (j < n) {
            c[k++] = b[j++];
        }
    }
}