Leetcode 剑指 Offer 30.包含min函数的栈 Python 3

Leetcode 剑指 Offer 30题参考代码如下：

class MinStack:

    def __init__(self):
        """
        initialize your data structure here.
        """
        self.queue=[]


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


    def pop(self) -> None:
        self.queue.pop(0)


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


    def min(self) -> int:
        return min(self.queue)



# Your MinStack object will be instantiated and called as such:
# obj = MinStack()
# obj.push(x)
# obj.pop()
# param_3 = obj.top()
# param_4 = obj.min()

题目链接：

力扣https://leetcode.cn/problems/bao-han-minhan-shu-de-zhan-lcof