public static void merge(int A[],int m,int B[],int n){
for(int i=0;i<n;i++){
A[m]=B[i];
for(int j=m;j>0;j--){
if(A[j]<A[j-1]) {
int curr = A[j];
A[j]=A[j-1];
A[j-1]=curr;
}else {
break;
}
}
m++;
}
}
标签:int,i0,美团,merge,算法,static,简单,void
来源: https://blog.csdn.net/Chasel_s/article/details/120979439