- sort(a,a+n);
- n = unique(a,a+n) - a;
-
去重函数最后输出的结果是排序好的结果,并不是原来的序列。#include<iostream> #include<cstdio> #include<algorithm> using namespace std; const int N = 100000; int a[N+5]; int main() { int n; while (cin>>n) { for (int i = 0;i < n;++i) { scanf("%d",&a[i]); } sort(a,a+n); n = unique(a,a+n) - a; for (int i = 0;i < n;++i) { printf("%d ",a[i]); } puts(""); } return 0; }
去重函数
最新推荐文章于 2022-11-30 23:26:33 发布