思路:
采用两个栈,且两个栈长度相同
- self.result栈中存放元素
- self.min栈中存放每次添加元素时result栈中元素的最小值。result栈和mi栈长度相同
- 注意:本方法采用两个栈长度相同的策略,即min栈中存放的是result栈中添加或删除元素后result栈中的最小值。若采用min栈中只存放最小值(遇到大的值min栈不更新),则此时MinStack.pop()不好实现
class MinStack:
def __init__(self):
"""
initialize your data structure here.
"""
self.result=[]
self.min=[]
def push(self, x):
"""
:type x: int
:rtype: void
"""
self.result.append(x)
if len(self.min)==0:
self.min.append(x)
else:
if x<self.min[-1]:
self.min.append(x)
else:
self.min.append(self.min[-1])
def pop(self):
"""
:rtype: void
"""
self.min.pop()
self.result.pop()
def top(self):
"""
:rtype: int
"""
return self.result[-1]
def getMin(self):
"""
:rtype: int
"""
return self.min[-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()