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.
这道题让归并两个排好序的数组,并假设A数组的size足够大。这道题的思路是定义三个指针i,j,k,分别指向A数组的最后一位数,B数组的最后一位数,以及A数组的最后一位。然后从大到小从后往前归并就可以了。
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--];
else
A[k--] = B[j--];
}
while (j >= 0)
A[k--] = B[j--];
}