题解 | #有序序列合并#
有序序列合并
https://www.nowcoder.com/practice/a9e943b0dab142759807d0cfb6863897
#include <stdio.h>
int main() {
int n,m;
int i,j;
int arr1[1000];
int arr2[1000];
int arr[2000];
scanf("%d %d",&n,&m);
for(i=0;i<n;i++){
scanf("%d",&arr1[i]);
}
for(j=0;j<m;j++){
scanf("%d",&arr2[j]);
}
i=0;
j=0;
int k=0;
while(i<n&&j<m){
if(arr1[i]>arr2[j]){
arr[k++]=arr2[j++];
}
else
arr[k++]=arr1[i++];
}
if(i==n)
{ for(;j<m;j++)
arr[k++]=arr2[j];
}
if(j==m)
{
for(;i<n;i++){
arr[k++]=arr1[i];
}
}
for(i=0;i<m+n;i++)
printf("%d ",arr[i]);
return 0;
}
