#include<stack>

bool IsStackSquence(int* array1, int length1, int* array2, int length2)

{

    bool IsOutStack = true;

    if(array1 == NULL || length1 <=  || array2 == NULL || length2 <=  || length1 != length2)

        return !IsOutStack;

    std::stack<int> st;

    int i = ;

    int j = ;

    st.push(array1[i++]);

    while(j < length2)

    {

        while(array2[j] != st.top() && i < length1)

        {

            st.push(array1[i]);

            i++;

        }

        if(array2[j] != st.top() && i == length1)

            return !IsOutStack;

        st.pop();

        j++;

    }

    return IsOutStack;

}

#include <stack>

bool IsPopOrder(const int* pPush, const int* pPop, int nLength)

{

    bool bPossible = false;

    if(pPush != NULL && pPop != NULL && nLength > )

    {

        const int* pNextPush = pPush;

        const int* pNextPop = pPop;

        std::stack<int> stackData;

        while(pNextPop - pPop < nLength)

        {

            // 当辅助栈的栈顶元素不是要弹出的元素

            // 先压入一些数字入栈

            while(stackData.empty() || stackData.top() != *pNextPop)

            {

                // 如果所有数字都压入辅助栈了，退出循环

                if(pNextPush - pPush == nLength)

                    break;

                stackData.push(*pNextPush);

                pNextPush ++;

            }

            if(stackData.top() != *pNextPop)

                break;

            stackData.pop();

            pNextPop ++;

        }

        if(stackData.empty() && pNextPop - pPop == nLength)

            bPossible = true;

    }

    return bPossible;

}