Leetcode刷题记录——面试题 03.02. 栈的最小值

最新推荐文章于 2023-05-27 16:49:37 发布

1996MZH

最新推荐文章于 2023-05-27 16:49:37 发布

阅读量136

点赞数

分类专栏： leetcode python编程技巧

本文链接：https://blog.csdn.net/weixin_41545780/article/details/105631240

版权

python编程技巧同时被 2 个专栏收录

286 篇文章 0 订阅

订阅专栏

leetcode

254 篇文章 0 订阅

订阅专栏

![在这里插入图片描述](https://img-blog.csdnimg.cn/20200420113705219.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MTU0NTc4MA==,size_16,color_FFFFFF,t_70

考虑双栈
一个存储数据
一个存储每个位置的最小值

class MinStack:

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


    def push(self, x: int) -> None:
        self.val_stack.append(x)
        if self.min_stack != []:
            self.min_stack.append(min(self.min_stack[-1],x))
        else:
            self.min_stack.append(x)



    def pop(self) -> None:
        self.min_stack.pop(-1)
        return self.val_stack.pop(-1)


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


    def getMin(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.getMin()