题解 | #整型数组合并#
整型数组合并
https://www.nowcoder.com/practice/c4f11ea2c886429faf91decfaf6a310b
#include<stdio.h>
#include<string.h>
int main()
{
int count1;
int count2;
int a[1000];
int b[1000];
int c[1000];
int d[1000];
scanf("%d",&count1);
for(int i = 0; i < count1; i++)
{
scanf("%d",&a[i]);
c[i] = a[i];
}
scanf("%d",&count2);
for(int i = 0; i < count2; i++)
{
scanf("%d",&b[i]);
c[count1 + i ] = b[i];
}
for(int i = 0; i < count1 + count2; i++)
{
for(int j = i + 1; j < count1 + count2; j++)
{
if(c[i] > c[j])
{
int temp = c[i];
c[i] = c[j];
c[j] = temp;
}
}
d[i] = c[i];
if (i== 0)
printf("%d",d[i]);
else if (d[i-1] != c[i])
printf("%d",d[i]);
else
continue;
}
return 0;
}
备注学习:该题难点在于如何数组中如何删掉重复数字。

查看18道真题和解析