剑指 Offer 31. 栈的压入、弹出序列

思路#

思路来源：https://leetcode-cn.com/problems/validate-stack-sequences/

 

 

 

class Solution {
public:
    bool validateStackSequences(vector<int>& pushed, vector<int>& popped) {
        stack<int> s;
        int i = 0;
        for(int e: pushed) {
            s.push(e);
            while(!s.empty() && s.top() == popped[i]) {
                s.pop();
                i++;
            }
        }

        return s.empty();
    }

};