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

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param pushV int整型vector 
     * @param popV int整型vector 
     * @return bool布尔型
     */
    bool IsPopOrder(vector<int>& pushV, vector<int>& popV)
     {
        size_t p1=0, p2 = 0;
        stack<int> simulateStack;
       while(p2 < popV.size())
       {
        while(simulateStack.empty()||
        simulateStack.top() != popV[p2] && p1<pushV.size())
         {
         simulateStack.push(pushV[p1++]);
         }
        if(simulateStack.top() == popV[p2])
        {
          simulateStack.pop();
        }
        else {
        {
           break;
        }
        }
        p2++;

       }

        return simulateStack.empty();
    }
};