题解 | #有序序列合并#

#include<stdio.h>
int main()
{
	int n, m,i,j;
	int count = 0;
	int arr1[1000]={0};
	int arr2[1000]={0};
	int arr[2000] = { 0 };
	scanf("%d %d", &n, &m);
	for (i = 0; i < n; i++)
	{
		scanf("%d", &arr1[i]);
	}
	for (i = 0; i < m; i++)
	{
		scanf("%d", &arr2[i]);
	}
	//1 2 3 5 6
	//4 5 6
	i = 0;
	j = 0;
	count = 0;
	while (i < n && j < m)
	{
		if (arr1[i] < arr2[j])
		{
			arr[count] = arr1[i];
			i++;
		}
		else
		{
			arr[count] = arr2[j];
			j++;
		}
		count++;
	}
	//当两组数不一样的时候，要将剩余的数组全部放到新数组中
	int k = 0;
	if (i == n)
	{
		for (k = j; k < m; k++)
		{
			arr[count] = arr2[k];
			count++; 
		}
	}
	else
	{
		for (k=i;k<n;k++)
		{
			arr[count] = arr1[k];
			count++;
		}
	}

	for (i = 0; i < n + m; i++)
	{
		printf("%d ", arr[i]);
	}
	return 0;
}