数据结构-栈的压入、弹出序列

/*
剑指offer面试题22
*/
#include <iostream>
#include <stack>

using namespace std;

bool IsPopOrder(stack<int> pushOrder,stack<int> popOrder,int length,int* p){
    bool Possible = false;

    int num = 0;
    pushOrder.push(p[num]);

    if(popOrder.empty() || length <= 0){
        return false;
    }

    while(!popOrder.empty()){
        while(popOrder.top() != pushOrder.top()){
            if(num >= length){
                break;
            }
            pushOrder.push(p[num++]);
        }

        if(popOrder.top() != pushOrder.top()){
            break;
        }

        popOrder.pop();
        pushOrder.pop();
    }

    if(popOrder.empty()){
        Possible = true;
    }

    return Possible;
}

int main()
{
    stack<int> pushOrder;
    int p[5],pu[5];
    stack<int> popOrder;

    int n;
    for(int i=0;i<5;i++){
        cin >> n;
        p[i] = n;
    }

    for(int i=4;i>=0;i--){
        cin >> n;
        pu[i] = n;
    }

    for(int i=0;i<5;i++){
        popOrder.push(pu[i]);
    }

    bool result = IsPopOrder(pushOrder,popOrder,popOrder.size(),p);

    cout << result << endl;

    return 0;
}