版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/sumup/article/details/78168898
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
vector<int> veci;
for(int i=0;i<10;++i)
{
veci.push_back(i);
veci.push_back(i);
veci.push_back(i+2);
}
vector<int>::iterator iter;
vector<int>::iterator pos;
cout<<"Original:";
for(iter=veci.begin();iter!=veci.end();++iter)
cout<<*iter<<" ";
cout<<endl;
cout<<"Sort: ";
sort(veci.begin(),veci.end());
for(iter=veci.begin();iter!=veci.end();++iter)
cout<<*iter<<" ";
cout<<endl;
cout<<"Unique: ";
pos=unique(veci.begin(),veci.end());
for(iter=veci.begin();iter!=veci.end();++iter)
cout<<*iter<<" ";
cout<<endl;
cout<<"Erase: ";
veci.erase(pos,veci.end());
for(iter=veci.begin();iter!=veci.end();++iter)
cout<<*iter<<" ";
}