栈的压入、弹出序列

 1 class Solution {
 2 public:
 3     bool IsPopOrder(vector<int> pushV,vector<int> popV) {
 4         if(pushV.size()==0 || popV.size()==0)return false;
 5         std::stack<int> sta;
 6         int n=0;
 7         for(size_t i=0; i<pushV.size(); ++i)
 8         {
 9             sta.push(pushV[i]);
10             while(sta.size()!=0 && sta.top()==popV[n])
11             {
12                 sta.pop();
13                 ++n;
14             }
15         }
16         return !sta.size();
17     }
18 };