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

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param pushV int整型vector 
     * @param popV int整型vector 
     * @return bool布尔型
     */
    bool IsPopOrder(const vector<int>& pushV, const vector<int>& popV) {
        stack<int> st;
        auto push = pushV.begin();
        auto pop = popV.begin();
        while(push != pushV.end())
        {
            st.push(*push);
            while(pop != popV.end() && !st.empty() && st.top() == *pop)
            {
                st.pop();
                ++pop;
            }
            ++push;
        }
        return pop == popV.end();
    }
};