155. Min Stack - Unsolved
Posted Premiumlab
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了155. Min Stack - Unsolved相关的知识,希望对你有一定的参考价值。
https://leetcode.com/problems/min-stack/#/solutions
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.
Example:
MinStack minStack = new MinStack(); minStack.push(-2); minStack.push(0); minStack.push(-3); minStack.getMin(); --> Returns -3. minStack.pop(); minStack.top(); --> Returns 0. minStack.getMin(); --> Returns -2.
Sol:
class MinStack(object): def __init__(self): """ initialize your data structure here. """ self.stack = [] # set two stacks self.minStack = [] def push(self, x): self.stack.append(x) if len(self.minStack) and x == self.minStack[-1][0] def pop(self): self.minStack.pop() return self.stack.pop() def top(self): """ # :rtype: int """ return self.stack[-1] def getMin(self): """ # :rtype: int """ return self.minStack[ len(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()
Submission Result: Runtime Error More Details Runtime Error Message: Line 44: IndexError: list index out of range Last executed input: ["MinStack","push","push","push","getMin","top","pop","getMin"] [[],[-2],[0],[-1],[],[],[],[]]
Back - up knowledge:
Implementation of Stack
Some sols:
1
https://discuss.leetcode.com/topic/11985/my-python-solution
2
https://discuss.leetcode.com/topic/37294/python-one-stack-solution-without-linklist
3
http://bookshadow.com/weblog/2014/11/10/leetcode-min-stack/
4
http://www.aichengxu.com/data/720464.htm
5
以上是关于155. Min Stack - Unsolved的主要内容,如果未能解决你的问题,请参考以下文章