题解 | #有序序列合并#
有序序列合并
https://www.nowcoder.com/practice/a9e943b0dab142759807d0cfb6863897
#include <stdio.h> int main() { int n = 0; int m = 0; scanf("%d %d", &n, &m);//第二行n个整数 第三行m个整数 int arr1[1000] = { 0 };//初始化数组 int arr2[1000] = { 0 }; int i = 0; int j = 0; for ( i = 0; i < n; i++) { scanf("%d", &arr1[i]); } for ( j = 0; j < m; j++) { scanf("%d", &arr2[j]); } i = 0; j = 0; while (i < n && j < m) { if (arr1[i] < arr2[j]) { printf("%d ", arr1[i]); i++; } else { printf("%d ", arr2[j]); j++; } } if (i == n && j < m) for (; j < m; j++) printf("%d ", arr2[j]); else for (; i < n; i++) printf("%d ", arr1[i]); return 0; }