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