合并两个升序排序的int类型数组

版权声明：转载本博客，请注明来源，谢谢 https://blog.csdn.net/kisorl/article/details/80760156

例如：输入：[1,3,4] [1,1,2,5] 输出：[1,1,1,2,3,4,5]

int i = 0;  
        int j = 0;  
        int k = 0;  
        int[] a = new int[]{1,3,4};  
        int[] b = new int[]{1,1,2,5};  
        int[] c = new int[a.length + b.length]; 
        while (i < a.length && j < b.length) {  
            if (a[i] < b[j]) {  
                c[k++] = a[i++]; 
            } else {  
                c[k++] = b[j++];  
            }   
        }
        while (i < a.length) {  
            c[k++] = a[i++];  
        }  
        while (j < b.length) {  
            c[k++] = b[j++];  
        } 
        System.out.println(Arrays.toString(c));