正文
剑指offer-包含min函数的栈-栈和队列-python
提示：扫一扫查出行【扫一扫了解最新限行尾号】
复制提示
题目描述定义栈的数据结构，请在该类型中实现一个能够得到栈中所含最小元素的min函数（时间复杂度应为O（1））。 # -*- coding:utf-8 -*-
class Solution:
def __init__(self):
self.stack = []
self.minstack = []
def push(self, node):
# write code here
if not self.minstack or self.minstack[-1] >= node:
self.minstack.append(node)
self.stack.append(node)
def pop(self):
# write code here
if self.stack[-1] == self.minstack[-1]:
self.minstack.pop()
self.stack.pop()
def top(self):
# write code here
return self.stack[-1]
def min(self):
# write code here
return self.minstack[-1]
定义栈的数据结构，请在该类型中实现一个能够得到栈中所含最小元素的min函数（时间复杂度应为O（1））。
# -*- coding:utf-8 -*-
class Solution:
def __init__(self):
self.stack = []
self.minstack = []
def push(self, node):
# write code here
if not self.minstack or self.minstack[-1] >= node:
self.minstack.append(node)
self.stack.append(node)
def pop(self):
# write code here
if self.stack[-1] == self.minstack[-1]:
self.minstack.pop()
self.stack.pop()
def top(self):
# write code here
return self.stack[-1]
def min(self):
# write code here
return self.minstack[-1]
