题解 | #包含min函数的栈#
包含min函数的栈
http://www.nowcoder.com/practice/4c776177d2c04c2494f2555c9fcc1e49
# -*- coding:utf-8 -*-
class Solution:
def __init__(self):
self.s = []
self.mins = []
self.min_val = None
def push(self, node):
# write code here
if len(self.mins)==0:
self.mins.append(node)
elif node <= self.mins[-1]:
self.mins.append(node)
else:
self.mins.append(self.mins[-1])
self.s.append(node)
def pop(self):
# write code here
self.s.pop()
self.mins.pop()
def top(self):
# write code here
return self.s[-1]
def min(self):
# write code here
return self.mins[-1]
class Solution:
def __init__(self):
self.s = []
self.mins = []
self.min_val = None
def push(self, node):
# write code here
if len(self.mins)==0:
self.mins.append(node)
elif node <= self.mins[-1]:
self.mins.append(node)
else:
self.mins.append(self.mins[-1])
self.s.append(node)
def pop(self):
# write code here
self.s.pop()
self.mins.pop()
def top(self):
# write code here
return self.s[-1]
def min(self):
# write code here
return self.mins[-1]
