STL-set basics (unfinished to continue tomorrow)

collection - set

That is to say, there are no duplicate elements in the set

The main purpose of constructing a set collection is for fast retrieval

In addition, set is a container (list, set, map) stored in the form of discontinuous nodes

1. Build

#include<iostream>
#include<set>
using namespace std;
int main()
{
    set<int> s;
    return 0;
}

 

2. Insert elements && traverse (using iterators)

#include<bits/stdc++.h>
using namespace std;
int main()
{
    set<int>s;
    for(int i = 0; i < 5; i++)
        s.insert(i);
    s.insert( 0 ); // try to repeatedly insert elements 
    set < int >::iterator it; // define forward iterator 
    for (it = s.begin(); it != s.end(); it++ )
        cout << *it << " ";
    cout << endl;
     set < int >::reverse_iterator rit; // Define the reverse iterator 
    for (rit = s.rbegin(); rit != s.rend(); rit++ )
        cout << *rit << " ";
    cout << endl;
    return 0;
}