题解 | 栈的压入、弹出序列

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