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 void merge(int A[], int m, int B[], int n) { int len = m + n; int k = len - 1; int i = m - 1; int j = n - 1; while (i >= 0 && j >= 0) { while (i >= 0 && j >= 0 && A[i] >= B[j]) { A[k--] = A[i--]; } while (i >= 0 && j >= 0 && A[i] < B[j]) { A[k--] = B[j--]; } } while (i >= 0) { A[k--] = A[i--]; } while (j >= 0) { A[k--] = B[j--]; } }
Merge Sorted Array,布布扣,bubuko.com
原文：http://blog.csdn.net/u010378705/article/details/29181647