用队列实现栈-栈与队列225-python

没看答案。

利用两个队列。

from collections import deque

class MyStack:
    def __init__(self):
        self.queue1 = deque()
        self.queue2 = deque()

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

        self.queue1, self.queue2 = self.queue2, self.queue1

    def pop(self) -> int:
        x = self.queue1.popleft()
        return x

    def top(self) -> int:
        return self.queue1[0]

    def empty(self) -> bool:
        return False if self.queue1 else True

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

利用一个队列。

class MyStack:

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

    def push(self, x: int) -> None:
        self.queue.append(x)
        self.length += 1

    def pop(self) -> int:
        num = self.queue.pop(-1)
        self.length -= 1
        return num

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

    def empty(self) -> bool:
        return True if self.length == 0 else 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()