Implement Stack using Queues LeetCode solution in Java

1
class MyStack {
2

3
  Queue<Integer> queue = null;
4

5
  public MyStack() {
6
    queue = new LinkedList<>();
7
  }
8

9
  public void push(int x) {
10

11
    Queue<Integer> tempQueue = new LinkedList<>();
12
    tempQueue.add(x);
13

14
    while (!queue.isEmpty()) {
15
      tempQueue.add(queue.remove());
16
    }
17

18
    queue = tempQueue;
19
  }
20

21
  public int pop() {
22
    return queue.remove();
23
  }
24

25
  public int top() {
26
    return queue.peek();
27
  }
28

29
  public boolean empty() {
30
    return queue.isEmpty();
31
  }
32
}