#返回栈内最小元素
class Solution1:
def __init__(self):
self.stack = []
self.min = None
self.minStack = []
def push(self, val):
self.stack.append(val)
if self.min is None:
self.min = val
if self.min > val:
self.min = val
self.minStack.append(self.min)
def pop(self):
self.minStack.pop()
return self.stack.pop()
def getMin(self):
return self.minStack[-1]
此处用到了保存栈内最小元素的栈,用到了一个栈保存最小元素。