LintCode Merge Sorted ArrayII 合并排序数组 II

合并两个排序的整数数组A和B变成一个新的数组。
Given two sorted integer arrays A and B, merge B into A as one sorted array.

样例
给出A = [1, 2, 3, empty, empty] B = [4,5]
合并之后A将变成[1,2,3,4,5]

注意
你可以假设A具有足够的空间（A数组的大小大于或等于m+n）去添加B中的元素。
You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from B. The number of elements initialized in A and B are m and n respectively.

class Solution {
    /**
     * @param A: sorted integer array A which has m elements, 
     *           but size of A is m+n
     * @param B: sorted integer array B which has n elements
     * @return: void
     */
     //O(m + n)
    public void mergeSortedArray(int[] A, int m, int[] B, int n) {
        int k = m + n -1, i = m - 1, j = n - 1;
        while( i >= 0 && j >= 0) {//将B中元素插入A中合适位置
            if(A[i] >= B[j]) {
                A[k--] = A[i--];
            }else {
                A[k--] = B[j--];
            }
        }
        if(j >= 0) {//B没插完
            while(j >= 0) {
                A[k--] = B[j--];
            }
        }
    }
}