题目描述
定义栈的数据结构,请在该类型中实现一个能够得到栈最小元素的min函数。
import java.util.Stack;
import java.util.Iterator;
public class Solution {
Stack<Integer> stack = new Stack<Integer>();
public void push(int node) {
stack.push(node);
}
public void pop() {
stack.pop();
}
public int top() {
return stack.peek();
}
public int min() {
int min = stack.peek();
int tmpMin = 0;
Iterator<Integer> iterator = stack.iterator();
while (iterator.hasNext()){
tmpMin = iterator.next();
if (min>tmpMin){
min = tmpMin;
}
}
return min;
}
}