【数组&归并】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 andn respectively.

将两个有序的数组归并存放在原数组A中，应该A有足够的空间，所以将两个数组从后往前比较放在指定的位置

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