【剑指Offer】42. 栈的压入、弹出序列

穿越隧道

---

康复训练第一题，深深地感觉又菜了，本来就很菜了

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