Solution

• 模拟法

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