基于前面的分析，我們可以寫出如下的參考代碼：

　　#include

　　/////////////////////////////////////////////////////////////////////////////

　　// Given a push order of a stack, determine whether an array is possible to

　　// be its corresponding pop order

　　// Input: pPush - an array of integers, the push order

　　// pPop - an array of integers, the pop order

　　// nLength - the length of pPush and pPop

　　// Output: If pPop is possible to be the pop order of pPush, return true.

　　// Otherwise return false

　　/////////////////////////////////////////////////////////////////////////////

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

　　{

　　bool bPossible = false;

　　if(pPush && pPop && nLength > 0)

　　{

　　const int *pNextPush = pPush;

　　const int *pNextPop = pPop;

　　// ancillary stack

　　std::stackstackData;

　　// check every integers in pPop

　　while(pNextPop - pPop < nLength)

　　{

　　// while the top of the ancillary stack is not the integer

　　// to be poped, try to push some integers into the stack

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

　　{

　　// pNextPush == NULL means all integers have been

　　// pushed into the stack, can't push any longer

　　if(!pNextPush)

　　break;

　　stackData.push(*pNextPush);

　　// if there are integers left in pPush, move

　　// pNextPush forward, otherwise set it to be NULL

　　if(pNextPush - pPush < nLength - 1)

　　pNextPush ++;

　　else

　　pNextPush = NULL;

　　}

　　// After pushing, the top of stack is still not same as

　　// pPextPop, pPextPop is not in a pop sequence

　　// corresponding to pPush

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

　　break;

　　// Check the next integer in pPop

　　stackData.pop();

　　pNextPop ++;

　　}

　　// if all integers in pPop have been check successfully,

　　// pPop is a pop sequence corresponding to pPush

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

　　bPossible = true;

　　}

　　return bPossible;

　　}

　　相關推薦：

　　2015年軟考信息技術處理員考前知識點總結匯總

　　2015年軟件水平考試《程序員》提高練習題匯總

　　2015軟件水平考試《程序員》知識點總結匯總