linux 函数参数压栈顺序 apue,九度 1366 栈的压入弹出序列

样例输出：

Yes

No

#include

#include

#include

#include

using namespace std;

bool isPopOrder(const vector &push, const vector &pop, int length)

{

bool sequence = false;

if(push.empty() || pop.empty() || length < 0)

return sequence;

vector::const_iterator iNextPush = push.begin();

vector::const_iterator iNextPop = pop.begin();

stack stack;

while(iNextPop - pop.begin() < length)

{

while(stack.empty() || stack.top() != *iNextPop)

{

if(iNextPush - push.begin() == length)

break;

stack.push(*iNextPush);

++iNextPush;

}

if(stack.top() != *iNextPop)

break;

stack.pop();

++iNextPop;

}

if(stack.empty() && iNextPop - pop.begin() == length)//这是if 不是while

sequence = true;

return sequence;

}

int main(int argc, char *argv[])

{

int n;

while(scanf("%d", &n) != EOF)

{

int value;

vector push, pop;

int i;

for(i = 0; i < n; ++i)

{

scanf("%d", &value);

push.push_back(value);

}

for(i = 0; i < n; ++i)

{

scanf("%d", &value);

pop.push_back(value);

}

if(isPopOrder(push, pop, n))

printf("Yes\n");

else

printf("No\n");

}

return 0;

}