力扣(leetcode) 232. 用栈实现队列 (两个栈实现队列)

题目在这:https://leetcode-cn.com/problems/implement-queue-using-stacks/

思路分析:

用两个栈实现队列操作，元素先进A栈，再进B栈，再弹出 即可实现先进先出的效果。

比如 1，2，3，4 。
进A栈 再出A站 变为 4,3,2,1.
再进B栈，在出B栈。 变为 1，2，3，4

完整代码

class MyQueue:

    def __init__(self):
        """
        Initialize your data structure here.
        """
        self.stack1 = []
        self.stack2 = []

    def push(self, x: int) -> None:
        """
        Push element x to the back of queue.
        """
        self.stack1.append(x)

    def pop(self) -> int:
        """
        Removes the element from in front of queue and returns that element.
        """
        if not self.stack2: # B栈为空
            while self.stack1: # A栈不为空
                self.stack2.append(self.stack1.pop()) # 将A栈全加到B栈中
        return self.stack2.pop()

    def peek(self) -> int:
        """
        Get the front element.
        """
        if not self.stack2: # 操作同pop()
            while self.stack1:
                self.stack2.append(self.stack1.pop())
        return self.stack2[-1]

    def empty(self) -> bool:
        """
        Returns whether the queue is empty.
        """
        return  not self.stack1 and not self.stack2



# Your MyQueue object will be instantiated and called as such:
# obj = MyQueue()
# obj.push(x)
# param_2 = obj.pop()
# param_3 = obj.peek()
# param_4 = obj.empty()