棧的壓入彈出序列

標籤：棧的壓入彈出序列

輸入兩個整數序列,第一個序列表示棧的壓入順序,請判斷第二個序列是否為該棧的彈出順序。假設壓入棧的所有數字均不相等。

代碼：

#include <iostream>#include <stack>#include <assert.h>using namespace std;bool isStackSeq(int *pPush,int *pPop,int length){bool isstack = false;if(pPush != NULL && pPop != NULL && length > 0){constint *pPushNext = pPush;const   int *pPopNext = pPop;stack<int> stackData;while(pPopNext - pPop < length){//將元素入棧while(stackData.empty() ||  stackData.top()  !=  *pPopNext){if(pPushNext - pPush == length)break;stackData.push(*pPushNext);pPushNext ++;}if(stackData.top() != *pPopNext)break;stackData.pop();pPopNext ++;}if(stackData.empty() && pPushNext - pPush == length)isstack = true;}return isstack;}int main(){int data1[] = {1,2,3,4,5};int data2[] = {4,5,3,2,1};cout<< isStackSeq(data1,data2,sizeof(data1)/sizeof(int));    return 0;}

運行結果：