FilesExpand file tree

 master

/

MyStack.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

40 lines (34 loc) · 887 Bytes

 master

/

MyStack.java

Copy path

Top

File metadata and controls

• Code
• Blame

40 lines (34 loc) · 887 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

33

34

35

36

37

38

39

40

package DSandAL.StackAndQueue;

import java.util.LinkedList;

import java.util.Queue;

public class MyStack {

/** Initialize your data structure here. */

Queue<Integer> q1;

Queue<Integer> q2;

public MyStack() {

q1 = new LinkedList<>();

q2 = new LinkedList<>();

}

/** Push element x onto stack. */

public void push(int x) {

q1.add(x);

}

/** Removes the element on top of the stack and returns that element. */

public int pop() {

while(q1.size() > 1){

q2.add(q1.poll());

}

int res = q1.poll();

q1 = q2;

q2 = new LinkedList<>();

return res;

}

/** Get the top element. */

public int top() {

return q1.peek();

}

/** Returns whether the stack is empty. */

public boolean empty() {

return q1.isEmpty() && q2.isEmpty();

}

}