C/C++——set

#include<iostream>
#include<set>
#include<vector>
#include<iostream>

using namespace std;

int main()
{
    
    
    set<int>s;
    s.insert(2);
    s.insert(4);
    s.insert(8);
    s.insert(3);
    s.insert(2);///不能重复
    cout<<"size："<<s.size()<<endl;
    cout<<"maxsize："<<s.max_size()<<endl;
    cout<<"第一个元素 ："<<*s.begin()<<endl;
    cout<<"最后一个元素:"<<*s.end()<<endl;
    s.clear();
    if(s.empty())
    {
    
    
        cout<<"空"<<endl;
    }
    cout<<"size:"<<s.size()<<endl;
    cout<<"maxsize:"<<s.max_size()<<endl;
    cout<<"------------set对象的定义和初始化-------------"<<endl;
    vector<int>v;
    for(int i = 0; i < 10; i++)
        v.push_back(i);
    set<int>t(v.begin(), v.end());
    cout<<v.size()<<"   "<<t.size()<<endl;
    cout<<"------------set中数据的插入-------------"<<endl;
    set<int>::iterator it;
    for(it = t.begin(); it != t.end(); it++)
        cout<<"-"<<*it;
    cout<<endl;
    t.insert(11);///与map不同，set中数据只能通过insert()函数进行插入
    for(it = t.begin(); it != t.end(); it++)
        cout<<"-"<<*it;
    cout<<endl;
    cout<<"------------set中查找和读取元素-------------"<<endl;
    cout<<t.count(11)<<endl;
    cout<<*(t.find(11))<<endl;
    cout<<"------------set中删除元素-------------"<<endl;
    for(it = t.begin(); it != t.end(); it++)
        if(*it == 5)
            break;
    t.erase(it, t.end());
    set<int>::iterator it_1;
    for(it_1 = t.begin(); it_1 != t.end(); it_1++)
        cout<<"-"<<*it_1;
    cout<<endl;
    return 0;
}

参考原文链接