【数据结构】模拟实现stack

namespace my_stack
{//适配器模式/配接器template <class T,class Container=vector<T>>class stack {public:void push(const T& val){_con.push_back(val);}void pop(){_con.pop_back();}const T& top(){return _con.back();}size_t size(){return _con.size();}bool empty(){return  _con.empty();}private:Container _con;		 };void test1(){//The second parameter is haven stack<int> st;st.push(1);st.push(2);st.push(3);st.push(4);st.push(5);while (!st.empty()){cout << st.top() << " ";st.pop();}}}