【剑指offer】030.包含min函数的栈

题目

【剑指offer】030.包含min函数的栈

解法

这道题有一定的技巧性，自己根本想不到还能利用一个辅助栈。

class MinStack:

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

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


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

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

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


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