stack模拟实现比较简单，就是直接调用deque的函数即可。
具体实现：
#pragma once#include<deque>
#include<iostream>using std::istream;
using std::ostream;
using std::endl;
using std::cout;namespace zyy
{ //stack -> 后进先出template<class T, class Container = std::deque<T>>class stack{public:void push(const T& x){_con.push_back(x);}void pop(){_con.pop_back();}T& top(){return _con.back();}const T& top() const{return _con.back();}size_t size() const{return _con.size();}bool empty() const{return _con.empty();}private:Container _con;};
};测试：
#include "stack.h"
using namespace zyy;void test1()
{stack<int> st;st.push(1);st.push(2);st.push(3);st.push(4);st.push(5);cout << "栈顶元素: " << st.top() << endl;cout << "st.size : " << st.size() << endl;for (int i = 0; i < 5; ++i){//cout << "i: " << i << " ";cout << st.top() << " ";st.pop();}cout << endl;}int main()
{test1();return 0;
}测试结果：
