155. Min Stack
2017-08-07 10:23
25 查看
155. Min Stack
#!/usr/bin/env python class MinStack(object): def __init__(self): """ initialize your data structure here. """ self.stack = [] self.minStack = [] def push(self, x): """ :type x: int :rtype: void """ self.stack.append(x) if not self.minStack: self.minStack.append(x) else: top = self.minStack[-1] if top >= x: self.minStack.append(x) # def pop(self): """ :rtype: void """ if self.stack: x = self.stack.pop() top = self.minStack[-1] if x == top: return self.minStack.pop() def top(self): """ :rtype: int """ if self.stack: return self.stack[-1] def getMin(self): """ :rtype: int """ if self.minStack: return self.minStack[-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()
相关文章推荐
- 155. Min Stack
- 155. Min Stack
- 155. Min Stack
- LeetCode笔记:155. Min Stack
- Leetcode 155. Min Stack JAVA语言
- leetcode#155. Min Stack
- 15算法课程 155. Min Stack
- leetCode155. Min Stack
- 155. Min Stack
- 155. Min Stack
- 155. Min Stack
- 155. Min Stack*
- 155. Min Stack
- <LeetCode OJ> 155. Min Stack
- leetcode 155. Min Stack
- [LeetCode] 155. Min Stack 最小栈
- leetcode 155. Min Stack
- LeetCode 155. Min Stack
- LeetCode - 155. Min Stack
- [LeetCode]--155. Min Stack