栈:
#include<stack>
stack<TYPE>StackName
//frequently commands;
stack<int>s;
s.push(1);
s.pop();
s.empty();
vector 容器:
#include<vector>
vector<TYPE>s;
//frequently commands;
vector<int>a;
a.push_back(1); //add element;
//useing iterator to visit the element in vector;
vector<int>::iterator p;
for(p=a.begin();p!=a.end();p++)
{
cout<<*p<<endl;
}
``
`
MAP: //similar to LIST and SET;
#include<map>
map<TYPE,TYPE>s;
s.insert(XXX,XXX);
//using iterator to visit elements in map;
map<TYPE,TYPE>::iterator p;
for(p=map.begin();p!=map.end();p++)
{
cout<<p->first<<" "<<p->second<<endl;
}
//if finished pay attention to use s.clear();
QUEUE:
队列包括优先权队列;队列中要定义结构体但是要注意重载运算符;
//例题代码待续: