定义栈的数据结构,请在该类型中实现一个能够得到栈中所含最小元素的min函数(时间复杂度应为O(1))。
public class Test20 {
Stack<Integer> stack=new Stack<>();
private Stack<Integer> minstack=new Stack<>();
public void push(int node) {
stack.push(node);
if(minstack.isEmpty()){
minstack.push(node);
}else{
minstack.push(node<minstack.peek()?node:minstack.peek());
}
}
public void pop() {
stack.pop();
minstack.pop();
}
public int top() {
return stack.peek();
}
public int min() {
return minstack.peek();
}
}