import java.util.Stack;
/**
* 定义栈的数据结构,请在该类型中实现一个能够得到栈中所含最小元素的min函数
* (时间复杂度应为O(1))。
*/
public class Solution {
static Stack<Integer> date = new Stack<>();
static Stack<Integer> min = new Stack<>();
public static void push(int node) {
date.push(node);
if (min.size() != 0 && min.peek() < node){
min.push(min.peek());
}else {
min.push(node);
}
}
public static void pop() {
date.pop();
min.pop();
}
public static int top() {
return date.peek();
}
public static int min() {
return min.peek();
}
public static void main(String[] args){
Solution.push(4);
Solution.push(4);
Solution.push(7);
// Solution.push(1);
int a = Solution.min();
System.out.println(a);
}
}