65,211
社区成员
发帖
与我相关
我的任务
分享
#include<iostream>
#include<vector>
#include<functional>
#include<algorithm>
using namespace std;
int reduce( int ar[],int n);
int main(){
int n=9;
int a[]={9,8,7,6,5,4,3,2,1};
reduce(a,n);
return 0;
}
int reduce ( int ar[],int n) {
vector<int> svec(ar,ar+n);
vector<int>::iterator pointer;
vector<int>::iterator end;
sort(svec.begin(),svec.end()); //排序
end= unique(svec.begin(),svec.end());//连续相同的只留一个
int i = end - svec.begin();//剩下元素个数
cout << i <<endl;
for(pointer=svec.begin();pointer!=svec.end();pointer++)
cout <<*pointer <<endl;
system("pause");
return 0;
}
#include<iostream>
#include<vector>
#include<functional>
#include<algorithm>
using namespace std;
int reduce( int ar[],int n);
int main(){
int n=9;
int a[]={9,8,7,6,5,4,3,2,1};
reduce(a,n);
return 0;
}
int reduce ( int ar[],int n) {
vector<int> svec(ar,ar+n);
vector<int>::iterator pointer;
vector<int>::iterator end;
sort(svec.begin(),svec.end()); //排序
end= unique(svec.begin(),svec.end());//连续相同的只留一个
//int i = end - svec.begin();剩下元素个数
//cout << i <<endl;
for(pointer=svec.begin();pointer!=svec.end();pointer++)
cout <<*pointer <<endl;
system("pause");
return 0;
}