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.

原题链接：https://oj.leetcode.com/problems/merge-sorted-array/

题目：给定两个有序数组A和B，把B归并到A中为一个有序数组。

之前做过了类似的题，只是之前的题是新建一个数组，而这题是在原数组之上归并。

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