标签：
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.
从后向前merge，不需要排序且不会出现A中元素被覆盖。
1 void merge(int A[], int m, int B[], int n) 2 { 3 int i = m - 1, j = n - 1, k = m + n - 1; 4 5 while (i >= 0 && j >= 0) 6 if (A[i] > B[j]) 7 A[k--] = A[i--]; 8 else 9 A[k--] = B[j--]; 10 11 while (i >= 0) 12 A[k--] = A[i--]; 13 while (j >= 0) 14 A[k--] = B[j--]; 15 }
标签：
原文地址：http://www.cnblogs.com/ym65536/p/4178693.html
