LeetCode_algorithm/lintcode/stack/StackQueue.java at master · stanislashzc/LeetCode_algorithm · GitHub

43 lines (34 loc) · 930 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

package Algorithms.lintcode.stack;

import java.util.Stack;

public class StackQueue {

private Stack<Integer> stack1;

private Stack<Integer> stack2;

public StackQueue() {

// do initialization if necessary

stack1 = new Stack<Integer>();

stack2 = new Stack<Integer>();

}

public void push(int element) {

// write your code here

stack1.push(element);

}

public int pop() {

// write your code here

if (stack2.isEmpty()) {

while (!stack1.isEmpty()) {

stack2.push(stack1.pop());

}

}

return stack2.pop();

}

public int top() {

// write your code here

// write your code here

if (stack2.isEmpty()) {

while (!stack1.isEmpty()) {

stack2.push(stack1.pop());

}

}

return stack2.peek();

}

}