[Leetcode] 225. Implement Stack using Queues

Leetcode 225. Implement Stack using Queues

(3) Implement Stack using Queues - LeetCode

Implement Stack using Queues - LeetCode

Solution

from collections import deque


class MyStack:
    def __init__(self):
        self.q = collections.deque()

    def push(self, x: int) -> None:
        self.q.append(x)

    def pop(self) -> int:
        return self.q.pop()

    def top(self) -> int:
        return self.q[-1]

    def empty(self) -> bool:
        return len(self.q) == 0


# 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()