解题思路:
先排序,再删除
参考代码:
#include<iostream>
using namespace std;
#include<algorithm>
int main()
{
int n, a[1000],c=0,k=0;
cin >> n >> a[0];
for (int i = 1; i < n; i++)
cin >> a[i];
sort(a,a+n);
for (int i = 1; i < n; i++)
{
if (a[i] == a[i - 1]) continue;
k++;
}
cout << k+1 << endl<<a[0]<<" ";
for (int i = 1; i < n; i++)
{
if (a[i] == a[i - 1]) continue;
cout << a[i] << " ";
}
return 0;
}
0.0分
0 人评分