题解 | #有序序列合并#

有序序列合并

https://www.nowcoder.com/practice/a9e943b0dab142759807d0cfb6863897

#include <stdio.h>
int main()
{
	int a, b, c[10000], temp;
	scanf("%d", &a);
	scanf("%d", &b);
	for (int i = 1; i <= a + b; i++)
	{
		scanf("%d", &c[i]);
	}
	for (int i = 1; i <= a + b; i++)  //冒泡排序
	{
		for (int j = 1; j <= a + b - i; j++)
		{
			if (c[j] > c[j + 1])
			{
				temp = c[j];
				c[j] = c[j + 1];
				c[j + 1] = temp;
			}
		}
	}
	for (int i = 1; i < a + b + 1; i++) 
	{
		printf("%d ", c[i]);
	}
	return 0;
}

全部评论

相关推荐

野猪不是猪🐗:我assume that你must技术aspect是solid的,temperament也挺good的,however面试不太serious,generally会feel style上不够sharp
点赞 评论 收藏
分享
评论
点赞
收藏
分享

创作者周榜

更多
牛客网
牛客企业服务