Leetcode: Min Stack
来源:互联网 发布:龙门铣床的编程好编码 编辑:程序博客网 时间:2024/06/05 16:16
Question
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
push(x) – Push element x onto stack.
pop() – Removes the element on top of the stack.
top() – Get the top element.
getMin() – Retrieve the minimum element in the stack.
Solution
Analysis
refer to here.
Great Idea !
class MinStack(object): def __init__(self): """ initialize your data structure here. """ self.stack, self.minstack = [], [] def push(self, x): """ :type x: int :rtype: nothing """ self.stack.append(x) if self.minstack==[] or self.minstack[-1]>=x: self.minstack.append(x) def pop(self): """ :rtype: nothing """ if self.stack!=[]: elem = self.stack[-1] self.stack = self.stack[0:-1] if self.minstack!=[] and elem==self.minstack[-1]: self.minstack = self.minstack[0:-1] def top(self): """ :rtype: int """ if self.stack!=[]: return self.stack[-1] else: return None def getMin(self): """ :rtype: int """ if self.minstack!=[]: return self.minstack[-1] else: return None
0 0
- LeetCode[stack]: Min Stack
- [leetcode][stack] Min Stack
- 【Leetcode】Min Stack
- Leetcode: Min Stack
- leetcode Min stack
- Min Stack -- LeetCode
- Leetcode: Min Stack
- 【LeetCode】Min Stack
- leetcode Min Stack
- leetcode--Min Stack
- [Leetcode]Min stack
- leetcode:Min Stack
- leetcode 之 Min Stack
- leetcode Min Stack
- LeetCode(155) Min Stack
- [LeetCode]Min Stack
- leetcode:Min Stack
- leetcode - Min Stack
- hdoj4539郑厂长系列故事——排兵布阵【状压dp】
- 直接读写设备文件
- Centos7安装及使用webbench进行并发测试
- Leetcode: Majority Element
- Javascript获取select下拉框选中的的值
- Leetcode: Min Stack
- Leetcode: Min Stack
- leetcode #8 atoi
- 淘宝搜索技术代码你知多少
- iOS开发学习之UITableView
- NoClassDefFoundError的一个解决方法
- 【小熊刷题】Single Number II
- Leetcode: String to Integer (atoi)
- LightOJ 1184 - Marriage Media 【二分图最大匹配】