LeetCode14|合并排序的数组

输入:
A = [1,2,3,0,0,0], m = 3
B = [2,5,6],       n = 3

输出: [1,2,2,3,5,6]

 
public class MergeTest {
    public static void main(String[] args) {
        int[] A = {1, 2, 3, 0, 0, 0};
        int m = 3;
        int[] B = {2, 5, 6};
        int n = 3;
        merge(A, m, B, n);
        for (Integer num : A
        ) {
            System.out.print(num + "\t");
        }
    }

    public static void merge(int[] A, int m, int[] B, int n) {
        int[] result = new int[m + n];
        int i = 0;
        int j = 0;
        int pos = 0;
        while (i < m && j < n) {
            result[pos++] = A[i] < B[j] ? A[i++] : B[j++];
        }
        while (i < m) {
            result[pos++] = A[i++];
        }
        while (j < n) {
            result[pos++] = B[j++];
        }
        System.arraycopy(result, 0, A, 0, result.length);
    }
}