题解 | #有序序列合并#
有序序列合并
https://www.nowcoder.com/practice/a9e943b0dab142759807d0cfb6863897
#include <stdio.h> int main() { int a = 0; int b = 0; scanf("%d %d", &a, &b); int i = 0; int j = 0; int arr1[1000] = {0}; int arr2[1000] = {0}; for(i=0;i<a;i++) { scanf("%d",&arr1[i]);//输入第一个升序 } for(j=0;j<b;j++) { scanf("%d",&arr2[j]);//输入第二人升序 } i=0; j=0; while(i<a&&j<b) { if(arr1[i]>arr2[j]) { printf("%d ",arr2[j]); j++; } else { printf("%d ",arr1[i]); i++; } } if(i==a&&j<b) for(;j<b;j++) { printf("%d ",arr2[j]); } else for(;i<a;i++) { printf("%d ",arr1[i]); } return 0; }