2019牛客网刷题记录–剑指Offer(1)
题目描述:
包含min函数的栈
定义栈的数据结构,请在该类型中实现一个能够得到栈中所含最小元素的min函数(时间复杂度应为O(1))。
python实现:
// An highlighted block
# -*- coding:utf-8 -*-
class Solution:
def __init__(self):
self.stack = []
self.support_stack = []
# min_num其实可以不要,用support_stack[-1]表示即可
self.min_num = None
def push(self, num):
self.stack.append(num)
if self.min_num is None:
self.min_num = num
self.support_stack.append(self.min_num)
elif self.min_num < num:
self.support_stack.append(self.min_num)
else:
self.min_num = num
self.support_stack.append(num)
def pop(self):
if self.stack:
self.support_stack.pop()
return self.stack.pop()
return
def min(self):
return self.support_stack[-1]
https://blog.csdn.net/l_vip/article/details/79149183
JavaScript实现
var stack = [];
function push(node)
{
stack.push(node);
// write code here
}
function pop()
{
return stack.pop();
// write code here
}
function top()
{
return stack[stack.length - 1];
// write code here
}
function min()
{
return Math.min.apply(null, stack);
// write code here
}
c++实现
思路:
应用一个辅助栈,压的时候,如果A栈的压入比B栈压入大,B栈不压;小于等于,AB栈同时压入,出栈;如果,AB栈顶元素不等,A出,B不出。
class Solution {
public:
stack< int > stack1,stack2
void push(int value) {
stack1.push(value);
if(stack2.empty())
stack2.push(value);
else if(value<=stack2.top())
{
stack2.push(value);
}
}
void pop() {
if(stack1.top()==stack2.top())
stack2.pop();
stack1.pop();
}
int top() {
return stack1.top();
}
int min() {
return stack2.top();
}
};
链接: https://www.nowcoder.com/questionTerminal/4c776177d2c04c2494f2555c9fcc1e49.