FilesExpand file tree

 master

/

IsStackPopOrder.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

32 lines (26 loc) · 747 Bytes

 master

/

IsStackPopOrder.java

Top

File metadata and controls

• Code
• Blame

32 lines (26 loc) · 747 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

import java.util.ArrayList;

import java.util.Stack;

/**

* 剑指Offer，栈的压入弹出序列

*/

public class IsStackPopOrder {

public static void main(String[] args) {

int[] pushA = {1, 2, 3, 4, 5};

int[] popA = {4, 3, 5, 1, 2};

System.out.println(IsPopOrder(pushA, popA));

}

public static boolean IsPopOrder(int [] pushA,int [] popA) {

Stack<Integer> ss = new Stack<>();

for (int i = 0, j = 0; i < pushA.length; i++) {

ss.push(pushA[i]);

while (!ss.isEmpty() && ss.peek().intValue() == popA[j]) {

ss.pop();

j++;

}

}

if (ss.isEmpty()) {

return true;

}

return false;

}

}