-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.cpp
More file actions
48 lines (36 loc) · 781 Bytes
/
Copy pathmain.cpp
File metadata and controls
48 lines (36 loc) · 781 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
// 两个栈序列, 第一个为压栈序列, 第二个为出栈序列. 判断第二个序列是否为第一个序列的出栈序列
#include <stack>
bool IsPopOrder(const int *push, const int *pop, int len)
{
bool ret = false;
if (push && pop && len > 0)
{
const int *nextPush = push;
const int *nextPop = pop;
std::stack<int> stack;
while (nextPop - pop < len)
{
while (stack.empty() || stack.top() != *nextPop)
{
if (nextPush - push == len)
break;
stack.push(*nextPush);
++nextPush;
}
if (stack.top() != *nextPop)
break;
stack.pop();
++nextPop;
}
if (stack.empty() && nextPop - pop == len)
ret = true;
}
return ret;
}
int main()
{
int push[] = { 1, 2, 3, 4, 5 };
int pop[] = { 4, 5, 3, 2, 1 };
bool ret = IsPopOrder(push, pop, 5);
return 0;
}