题解 | #小乐乐与序列#
小乐乐与序列
http://www.nowcoder.com/practice/9a1c1c764ce04fed8ceff7714e74d3b6
#include <stdlib.h>
int cmp(const void* a, const void* b)
{
return *(int*)a-*(int*)b;
}
int main()
{
int n,count,i,j;
scanf("%d", &n);
int arr1[n];
count = 0;
for(i = 0; i < n; i++)
{
scanf("%d", &arr1[i]);
}
qsort(arr1, n, sizeof(int), cmp);
for(i = 0; i < n; i++)
{
if(arr1[i] == arr1[i + 1]) //相同则不输出
{
continue;
}
printf("%lld ", arr1[i]);
}
return 0;
}