include

class Solution {
public:
bool IsPopOrder(vector<int> pushV,vector<int> popV) {
if(pushV.size()!=popV.size())
return false;</int></int>

    int n = pushV.size();
    stack<int> temp;

    int i = 0; //压栈数组下标
    int j = 0; //出栈数组下标

    while(true)
    {
        if(!temp.empty() && temp.top() == popV[j]){ //若popV数组当前元素等于栈顶，说明ci'shi
            temp.pop();
            j++;
        }
        else{ //当栈为空或者popV数组当前元素不等于栈顶
            if(i == n)  //循环退出条件
                break;
            temp.push(pushV[i]);//入栈
            i++;
        }
    }
    if(temp.size() == 0)
        return true;
    else
        return false;
}

};