225. Implement Stack using Queues.py

# 225. Implement Stack using Queues

class MyStack:

    def __init__(self):
        self.stack = []

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

    def pop(self) -> int:
        value = self.stack[len(self.stack) - 1]
        self.stack = self.stack[:-1]
        return value

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

    def empty(self) -> bool:
        if len(self.stack) < 1:
            return True
        return False


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