题目:输入两个整数序列。其中一个序列表示栈的push 顺序,
判断另一个序列有没有可能是对应的pop 顺序。
#include <iostream>
#include <stack>
#include <assert.h>
using namespace std;
bool TestPopOrder(const int* pPush, const int* pPop, int nLength)
{
assert(pPush!=NULL && pPop!=NULL && nLength>0);
bool bPossible = false;
const int *pNextPush = pPush;
const int *pNextPop = pPop;
stack<int> stackData;
//当两个指针相减时,两个指针必须指向同一个对象数组的元素,有关一个指针能否加一个整数的问题
while(pNextPop - pPop < nLength)//pop尚未完成
{
while(stackData.empty() || stackData.top() != *pNextPop)
{
if(pNextPush==NULL)//所有的数值已经全部push进栈里;
{
break;
}
stackData.push(*pNextPush);
if(pNextPush - pPush < nLength)
{
pNextPush ++;
}
else
{
pNextPush = NULL;
}
}
if(stackData.top() != *pNextPop)//当所有数值都已经push,但是还不满足pop要求,则return false;
{
break;
}
stackData.pop();
pNextPop ++;
}
if(stackData.empty() && pNextPop - pPop == nLength)//数字全部正确地pop完
{
bPossible = true;
}
return bPossible;
}
int main()
{
int sarray[]={5,4,3,2,1};
int darray[]={4,3,5,1,2};
//int darray[]={4,5,3,2,1};
//int darray[]={3,5,4,2,1};
//int darray[]={5,4,3,2,1};
//int darray[]={1,4,5,3,2};
if(TestPopOrder(sarray,darray,5))
{
cout<<"right order"<<endl;
}
else
{
cout<<"wrong order"<<endl;
}
return 1;
}