栈的压入弹出序列

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

       int j=0;
        for(int i=0;i<pushV.size();++i)
        {
            normal.push(pushV[i]);
            while(!normal.empty()&&normal.top()==popV[j])
            {
                normal.pop();
                j++;
            }
        }

        return normal.empty();
    }
};