题目描述
定义栈的数据结构, 请在该类型中实现一个能够得到栈中所含最小元素的 min 函数 (时间复杂度应为 O(1)).
- class Solution:
- def __init__(self):
- self.stack=[]
- self.minj=0
- def push(self, node):
- # write code here
- self.stack.append(node)
- if len(self.stack)==0:
- self.minj=node
- else:
- self.minj=min(self.stack)
- def pop(self):
- # write code here
- self.stack.pop(-1)
- self.minj=min(self.stack)
- def top(self):
- # write code here
- self.stack[len(self.stack)-1]
- def min(self):
- # write code here
- return self.minj
来源: http://www.bubuko.com/infodetail-2963446.html