c++ set类型使用

#include <iostream>

#include <string>

#include <set>

#include <vector>

using namespace std;

int main()

{

///默认情况下，set元素按其所属型别的less-than进行排列

int ia[10] = {1,2,3,5,8,5,3,1,5,8};

vector<int> vec(ia,ia + 10);

set<int> iset(vec.begin(),vec.end());

set<int>::iterator index;

for( index = iset.begin(); index != iset.end(); index++ )

cout << *index << " ";



cout << endl;

//向set中加入元素，insert

iset.insert(9);

for( index = iset.begin(); index != iset.end(); index++ )

cout << *index << " ";

cout << endl;

///////向set中加入某个范围的元素

vector<int> vec1;

vec1.push_back(4);

vec1.push_back(6);

iset.insert(vec1.begin(),vec1.end());

for( index = iset.begin(); index != iset.end(); index++ )

cout << *index << " ";

cout << endl;

////泛型算法中有常用函数

/////交集 set_intersection(), 并集 set_union()等

return 0;

}