public static int [] mergeSort(int A[],int B[]){
int i = 0;
int j = 0;
int k = 0;
int []C = new int[A.length+B.length];
while (i<A.length&&j<B.length){
if(A[i]<B[j])
C[k++] = A[i++];
else
C[k++] = B[j++];
}
while(j<B.length)
C[k++] = B[j++];
while(i<A.length)
C[k++] = A[i++];
return C;
}
合并两个有序数组
最新推荐文章于 2025-02-25 09:00:00 发布