牛客:JZ31 栈的压入、弹出序列

思路：

 

 

 

class Solution {
public:
    bool IsPopOrder(vector<int> pushV,vector<int> popV) {
        stack<int> st;
        size_t pushi=0,popi=0;
        while(pushi<pushV.size()){
            st.push(pushV[pushi]);
            ++pushi;
            while(!st.empty() && st.top()== popV[popi]){
                st.pop();
                popi++;
            }
        }
        return popi==popV.size();
    }
};