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

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