【Leetcode笔记】用栈实现队列

Leetcode原题链接：用栈实现队列

一、代码

class MyQueue:

    def __init__(self):
        self.in_stack = []
        self.out_stack = []

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

    def pop(self) -> int:
        if self.empty():
            return None
        
        if self.out_stack:
            return self.out_stack.pop()
        else:
            for i in range(len(self.in_stack)):
                self.out_stack.append(self.in_stack.pop())
            return self.out_stack.pop()

    def peek(self) -> int:
        ret = self.pop()
        self.out_stack.append(ret)
        return ret

    def empty(self) -> bool:
        return not (self.in_stack or self.out_stack)


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

二、总结

• 个人感觉知道栈和队列是什么特性就好，掌握基本方法的代码即可。

部分内容参考代码随想录