Leetcode 225用队列实现栈

225用队列实现栈

class MyStack:

    def __init__(self):
        """
        Initialize your data structure here.
        """
        self.q1 = []
        self.q2 = []
        self.tp = None

    def push(self, x: int) -> None:
        """
        Push element x onto stack.
        """
        self.tp = x
        self.q1.append(x)

    def pop(self) -> int:
        """
        Removes the element on top of the stack and returns that element.
        """
        while len(self.q1) != 1:
            self.tp = self.q1.pop(0)
            self.q2.append(self.tp)
        res = self.q1.pop(0)
        self.q1, self.q2 = self.q2, self.q1
        return res

    def top(self) -> int:
        """
        Get the top element.
        """
        return self.tp

    def empty(self) -> bool:
        """
        Returns whether the stack is empty.
        """
        return self.q1 == []