【编程题】包含min函数的栈(Java实现)
题目来源
题目描述
定义栈的数据结构,请在该类型中实现一个能够得到栈中所含最小元素的min函数(时间复杂度应为O(1))。
题目代码
import java.util.Stack;
public class Solution {
Stack<Integer>stack1=new Stack<>();
Stack<Integer>minStack=new Stack<>();
public void push(int node) {
stack1.push(node);
if(minStack.isEmpty()||minStack.peek()>node)
minStack.push(node);
else
minStack.push(minStack.peek());
}
public void pop() {
if(!minStack.isEmpty())
minStack.pop();
stack1.pop();
}
public int top() {
return stack1.peek();
}
public int min() {
return minStack.peek();
}
}