7.stack

 #include <iostream>
 #include <stack>
 #include <algorithm>
 #include <list>
 #include <vector>
 using namespace std;

 void main()
 {
     //声明栈,默认是deque(因为删除插入效率比较高)
     stack<int> mystack;
     //声明链式栈
     stack<int, list<int>> myliststack;
     //声明数组栈
     stack<int, vector<int>> myliststack2;
     mystack.push();
     mystack.push();
     mystack.push();
     mystack.push();

     while (!mystack.empty())
     {
         cout << mystack.top() << endl;
         mystack.pop();
     }

     cin.get();
 }