225. Implement Stack using Queues刷题笔记

用一个队列实现栈

class MyStack:

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

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

    def pop(self) -> int:
        if self.queue:
            for _ in range(len(self.queue)-1):
                self.queue.append(self.queue.pop())
            return self.queue.pop()
        else:
            return None
        

    def top(self) -> int:
        tmp = self.pop()
        self.push(tmp)
        return tmp

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


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