import java.util.Stack;
import java.util.Iterator;
public class Solution {

Stack<Integer> s = new Stack<Integer>();
public void push(int node) {
s.push(node);
}

public void pop() {
s.pop();
}

public int top() {
return s.peek();
}

public int min() {
int min = s.peek();
int temp = 0;
Iterator<Integer> it = s.iterator();
while(it.hasNext()){
temp = it.next();
if(min > temp){
min = temp;
}
}
return min; 
}
}

 

扫码关注我们
微信号：SRE实战
拒绝背锅 运筹帷幄

SRE实战 互联网时代守护先锋，助力企业售后服务体系运筹帷幄！一键直达领取阿里云限量特价优惠。