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

class Solution {
public:
    bool IsPopOrder(vector<int> pushV,vector<int> popV) {
        stack<int> s;
        int j=0;
        int n=pushV.size();
        for(int i=0;i<n;i++){
            s.push(pushV[i]);
            while(!s.empty()&&s.top()==popV[j]){
                s.pop();
                j++;
            }
        }
        if(j<n) return false;
        return true;
    }
};