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