python栈的最小值

class MinStack:

    def __init__(self):
        """
        initialize your data structure here.
        """
        self.min_stack=list()   #辅助栈，用来存每一次进栈时的最小值，最小值就辅助栈，比辅助栈的值大是不需要进
        self.stack=list()       #栈


    def push(self, x: int) -> None:
        self.stack.append(x)
        if not self.min_stack or x<=self.min_stack[-1]:
            self.min_stack.append(x)

    def pop(self) -> None:
        tmp=self.stack.pop()
        if tmp==self.min_stack[-1]:
            self.min_stack.pop()

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

    def getMin(self) -> int:
        return self.min_stack[-1]