题解 | #小乐乐与序列#
小乐乐与序列
https://www.nowcoder.com/practice/9a1c1c764ce04fed8ceff7714e74d3b6
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
int main()
{
int arr[100001] = { 0 };
int k = 0, i = 0;
int n = 0;
int max = 0;
scanf("%d", &k);
for (i = 0; i < k; i++)
{
scanf("%d", &n);
if (max < n)
max = n;
if (arr[n] == 0)
arr[n]++;
}
for (i = 0; i <= max; i++)
{
if (arr[i])
printf("%d ", i);
}
return 0;
}
