栈的压入,弹出序列

class Solution {
public:
    bool IsPopOrder(vector<int> pushV,vector<int> popV) {
        vector<int> temp;
        if(pushV.size()==0){
            return false;
        }
        for(int i=0,j=0;i<pushV.size(); ){
               temp.push_back(pushV[i++]);
          while(!temp.empty() && popV[j]==temp.back()){
              temp.pop_back();
              j++;
              
          }
            
        }
        return temp.empty();
    }
};