public class Solution {
public void merge(int A[], int m, int B[], int n) {
int pos = m+n-1;
int a = m-1;
int b = n-1;
while(a>=0 && b>=0){
if (A[a] > B[b]){
A[pos] = A[a];
--a;
}else{
A[pos] = B[b];
--b;
}
--pos;
}
if (a<0){
while(b>=0){
A[b] = B[b];
--b;
}
}
}
}
Merge Sorted Array
最新推荐文章于 2022-06-26 11:00:52 发布