stack 栈
#include<iostream>
#include<stack>
int main(){
stack<int> per;
per.size();
per.top();
per.pop();
per.push(x);
per.empty();
}
queue 队列
#include<iostream>
#include<queue>
int main(){
queue<int> per;
per.size();
per.front();
per.pop();
per.push(x);
per.empty();
}
vector 向量
#include<iostream>
#include<vector>
int main(){
vector<int> per;
per.size();
per.push_back(x);
per.pop_back();
per.begin();
per.end();
per.insert(p,x);
per.erase(p);
per.clear();
}
list 双向列表
#include<iostream>
#include<list>
int main(){
list<int> per;
per.size();
per.begin();
per.end();
per.push_front(x);
per.push_back(x);
per.pop_front(x);
per.pop_back(x);
per.insert(p,x);
per.erase(P);
per.clear();
}