栈的压入，弹出序列

#include<iostream>
#include<vector>
#include<stack>
using namespace std;
bool IsPopOrder(vector<int> pushV,vector<int> popV) {
    int pushV_size = pushV.size();
    int popV_size = popV.size();
    if(pushV_size != popV_size) return false;
    stack<int> stack_1;
    int i=0,j=0;
    for(;i<pushV_size&&j<popV_size;){
        if(pushV[i] == popV[j]){
            i++;
            j++;
        }else{
            stack_1.push(pushV[i]);
            i++;
        }
    }
    if(!stack_1.empty()){
        for(;j<popV.size();j++){
            if(stack_1.top() == popV[j]){
                stack_1.pop();
            }else{
                return false;
            }
        }
    }
    return true;
}

int main() {
    vector<int> pushV = {1,2,3,4,5};
    vector<int> popV = {4,3,5,1,2};
    bool res = IsPopOrder(pushV,popV);
    cout<<res;
    return 0;
}