void merge(int* a1, int nums1Size, int m, int* a2, int nums2Size, int n){
int i=0, j=0, index=0;
for(i=0; i<m; i++) {
a1[m+n-i-1] = a1[m-i-1];
}
i = n;j=0;
while(index < m+n) {
if(i<n+m && j<n) {
if(a1[i] < a2[j]){
a1[index++] = a1[i++];
}else{
a1[index++] = a2[j++];
}
continue;
}
while(i<n+m) {
a1[index++] = a1[i++];
}
while(j<n) {
a1[index++] = a2[j++];
}
}
}
leetcode-88-合并两个有序的数组-C语言
最新推荐文章于 2024-08-08 22:07:05 发布