Leetcode 225. Implement Stack using Queues

Problem

Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack (push, top, pop, and empty).
Implement the MyStack class:

• void push(int x) Pushes element x to the top of the stack.
• int pop() Removes the element on the top of the stack and returns it.
• int top() Returns the element on the top of the stack.
• boolean empty() Returns true if the stack is empty, false otherwise.
  Notes:
• You must use only standard operations of a queue, which means that only push to back, peek/pop from front, size and is empty operations are valid.
• Depending on your language, the queue may not be supported natively. You may simulate a queue using a list or deque (double-ended queue) as long as you use only a queue’s standard operations.

Algorithm

New element is put into Queue 2, then the elements in Queue 1 are sequentially stored into Queue 2. Finally, all elements are stored in Queue 1 in order.

Code

class MyStack:

    def __init__(self):
        self.q1 = deque()
        self.q2 = deque()

    def push(self, x: int) -> None:
        self.q2.append(x)
        while self.q1:
            self.q2.append(self.q1.popleft())
        while self.q2:
            self.q1.append(self.q2.popleft())

    def pop(self) -> int:
        if not self.q1:
            return None
        else:
            ans = self.q1.popleft()
            return ans

    def top(self) -> int:
        if not self.q1:
            return None
        else:
            ans = self.q1.popleft()
            self.push(ans)
            return ans

    def empty(self) -> bool:
        return not len(self.q1)


# Your MyStack object will be instantiated and called as such:
# obj = MyStack()
# obj.push(x)
# param_2 = obj.pop()
# param_3 = obj.top()
# param_4 = obj.empty()