Merge Sorted Array

https://oj.leetcode.com/problems/merge-sorted-array/

Given two sorted integer arrays A and B, merge B into A as one sorted array.

Note:
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.

public void merge(int A[], int m, int B[], int n)
这题又是一个休闲题，从后往前merge就好。直接放代码吧

    public void merge(int A[], int m, int B[], int n) {
        for(int i = m + n - 1, j = m - 1, k = n - 1; i >= 0; i--){
            if(k < 0 || (j >= 0 && A[j] >= B[k])){
                A[i] = A[j];
                j--;
            }else{
                A[i] = B[k];
                k--;
            }
        }
    }