有序数组的合并

合并一个有序数组

public static int[] merge(int[] arr1, int[] arr2) {
        if(arr1.length == 0) return arr2;
        if(arr2.length == 0) return arr1;
        int n1 = arr1.length, n2 = arr2.length;
        int[] res = new int[n1+n2];
        int i1=0,i2=0, i =0;
        while (i1<n1 && i2 < n2) {
            if(arr1[i1] < arr2[i2]) {
                res[i++] = arr1[i1++];
            } else {
                res[i++] = arr2[i2++];
            }
        }
        while (i1 < n1) {
            res[i++] = arr1[i1++];
        }
        while (i2 < n2) {
            res[i++] = arr2[i2++];
        }
        return res;
    }