栈和队列

栈

/** 栈*/#include <iostream>#include <stack>using namespace std;int main(){    stack<int> s;//声明存储int类型数据的栈    s.push(1);//将1压栈    s.push(2);    s.push(3);    cout << s.top() << endl;//输出3    s.pop();//3出栈    cout << s.top() << endl;//输出2    s.pop();//2出栈    cout << s.top() << endl;//输出1    s.pop();//1出栈    return 0;}

队列

#include <iostream>#include <queue>using namespace std;int main(){    queue<int> que;//声明存储int类型数据的队列    que.push(1);//1    que.push(2);    que.push(3);    cout << que.front() << endl;//输出1    que.pop();    cout << que.front() << endl;    que.pop();    cout << que.front() << endl;    que.pop();    return 0;}