weixin_45814366的博客

管理元素集合的STL容器大致分为两类。有顺序集合，称为序列式容器经过排序的集合，称为关联式容器setset是根据元素值进行排序的集合，所插入的元素在集合中唯一，不存在重复元素。#include<iostream>#include<set>using namespace std;void print(set<int> S){ cout<<S.size()<<":"; for(set<int>::iterator

list#include<iostream>using namespace std;#include<list>int main(){ list<char> L; L.push_front('b');//[b] L.push_back('c');//[bc] L.push_front('a');//[abc] cout<<L.front();//a L.push_back('d');//[abcd] cout<<L.

queue#include<iostream>using namespace std;#include<string>#include<queue>int main(){ queue<string> Q; Q.push("red"); Q.push("orange"); Q.push("yellow"); cout<<Q.front()<<endl;//red Q.pop(); cout<&

vector#include<iostream>using namespace std;#include<vector>void print(vector<double> V){ for(int i=0;i<V.size();i++) cout<<V[i]<<" "; cout<<endl;}int main(){ vector<double> V; V.push_back(0.1);

stack#include<iostream>using namespace std;#include<stack>int main(){ stack<int> S; S.push(1);//向栈中压入1 S.push(3);//向栈中压入2 cout<<S.size()<<endl;//输出2； cout<<S.top()<<endl;//2 S.pop();//删除栈顶元素