LintCode 6.合并排序數組 ||

import org.junit.Test;import java.util.Arrays;public class MergeSort {/*** @param A: sorted integer array A* @param B: sorted integer array B* @return: A new sorted integer array* <p>* 合并排序數組 II* 合并兩個排序的整數數組A和B變成一個新的數組。* <p>* 樣例* 給出A=[1,2,3,4]，B=[2,4,5,6]，返回 [1,2,2,3,4,4,5,6]* <p>* 挑戰* 你能否優化你的算法，如果其中一個數組很大而另一個數組很小？*/public int[] mergeSortedArray(int[] A, int[] B) {// write your code hereint i = A.length;int j = B.length;int x = 0;int y = 0;int[] C = new int[i + j];int k = 0;while (x < i && y < j) {if (A[x] <= B[y]) {C[k++] = A[x++];} else {C[k++] = B[y++];}}while (x < i) {C[k++] = A[x++];}while (y < j) {C[k++] = B[y++];}return C;}@Testpublic void testMergeSortedArray() {int[] A = {23, 4, 2, 34, 2, 34, 32};int[] B = {6, 245, 3, 234, 2, 46, 23, 45, 23423, 3, 4, 23};System.out.println(Arrays.toString(A));System.out.println(Arrays.toString(B));System.out.println(Arrays.toString(mergeSortedArray(A, B)));}
}