特点
头文件
#include<set>
用法
set<int> my_set;
my_set.insert(a);
my_set.erase(iter);
my_set.clear();
my_set.empty();
my_set.begin();
my_set.end();
my_set.size();
my_set.find(a);
my_set.rbegin();
my_set.rend();
my_set.lower_bound(key_value)
my_set.upper_bound(key_value)
案例
#include<iostream>
#include<set>
using namespace std;
int main(){
set<int> my_set;
int num[5] = {1,5,9,8,1};
for(int i=0;i<5;++i)
my_set.insert(num[i]);
auto iter = my_set.begin();
while(iter != my_set.end())
{
cout << *iter << ' ';
iter++;
}
cout << endl;
auto iterf = my_set.find(9);
cout << *iterf << endl;
my_set.erase(8);
my_set.erase(iterf);
my_set.clear();
cout << my_set.empty() << endl;
set<int> my_set1(num,num+5);
auto it1 = my_set1.lower_bound(1);
auto it2 = my_set1.upper_bound(1);
cout << *it1 << endl;
cout << *it2 << endl;
return 0;
}