哼。。这么简单还一次没过,气死我了……
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.
<pre name="code" class="java">public void merge(int A[], int m, int B[], int n) {while(m>0&&n>0){
if(A[m-1]>B[n-1]) A[m+n-1]=B[--n];
else A[m+n-1]=A[--n];
}
while(n>0) A[m+n-1]=B[--n];}