STL 常用容器和方法

• part1.序列容器

string
vector
queue

priority_queue p;//最大值优先，是大顶堆一种简写方式
//升序队列，小顶堆
priority_queue <int,vector<int>,greater<int> > q;
//降序队列，大顶堆
priority_queue <int,vector<int>,less<int> >q;

deque
stack
list

• part2.关联容器

set
map
unordered_map
多元素 set：unordered_multiset

#include<iostream>
#include<unordered_set>
using namespace std;
int main() {
    unordered_multiset<int> myUnorededMultiSet = { 10,20,50,30,10,100,70,30,40 };
    //正向迭代器测试
    cout << "正向迭代器遍历容器：";
    for (auto it = myUnorededMultiSet.begin(); it != myUnorededMultiSet.end(); ++it) {
        cout << *it << " ";
    }
    cout << endl;
    //正向常迭代器测试
    cout << "正向常迭代器遍历容器：";
    for (auto cit = myUnorededMultiSet.cbegin(); cit != myUnorededMultiSet.cend(); ++cit) {
        cout << *cit << " ";
    }
    cout << endl;
    return 0;
}

其他方法：