#include<iostream>
#include<algorithm>
#include<vector>
#include<list>
using namespace std;
int main()
{
int ia[] = {1, 2, 100, 4, 5, 100, 7, 100};
list<int> ilist(ia,ia+8);
ilist.sort();
vector<int> vec;
unique_copy( ilist.begin(), ilist.end(), back_inserter(vec) );
for(vector<int>::iterator iter = vec.begin();
iter != vec.end(); ++iter)
cout<<*iter<<" ";
cout<<endl;
return 0;
#include<algorithm>
#include<vector>
#include<list>
using namespace std;
int main()
{
int ia[] = {1, 2, 100, 4, 5, 100, 7, 100};
list<int> ilist(ia,ia+8);
ilist.sort();
vector<int> vec;
unique_copy( ilist.begin(), ilist.end(), back_inserter(vec) );
for(vector<int>::iterator iter = vec.begin();
iter != vec.end(); ++iter)
cout<<*iter<<" ";
cout<<endl;
return 0;
}
需要先排序ilist.sort()