LintCode Merge Sorted Array II

class Solution {
    /**
     * @param A and B: sorted integer array A and B.
     * @return: A new sorted integer array
     */
    public int[] mergeSortedArray(int[] A, int[] B) {
        // Write your code here
        int i = A.length - 1, j = B.length - 1;
        int length = A.length + B.length;
        int index = length - 1;
        int[] C = new int[length];
        while(i >= 0 && j >= 0) {
            if(A[i] > B[j]) {
                C[index--] = A[i--];
            }else {
                C[index--] = B[j--];
            }
        }
        while(i >= 0) {
            C[index--] = A[i--];
        }
        while(j >= 0){
            C[index--] = B[j--];
        }
        return C;
    }
}