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