实现一个特殊的栈,在实现栈的基本功能的基础上,再实现返回栈中最小元素的操作
思路:①创建两个栈——stackData用于存放数据,stackMin用于存放任一时刻 栈中的最小值
②根据下图来分析:首先压入4,Min中也压入4;然后压入5,5>4,所以Min中继续压入4;压入3,3<4,Min中压入3;压入6,Min中继续压入3。
③弹栈操作时,Min跟着Data栈一起弹出,这样可以保证任一时刻,Min栈的栈顶都是Data栈对应的最小元素。
public class GetMinStack {
public static class MyStack {
private Stack<Integer> stackData;
private Stack<Integer> stackMin;
public MyStack() {
this.stackData = new Stack<Integer>();
this.stackMin = new Stack<Integer>();
}
public void push(int newNum) {
if (this.stackMin.isEmpty()) {
this.stackMin.push(newNum);
} else if (newNum < this.getmin()) {
this.stackMin.push(newNum);
} else {
int newMin = this.stackMin.peek();
this.stackMin.push(newMin);
}
this.stackData.push(newNum);
}
public int pop() {
if (this.stackData.isEmpty()) {
throw new RuntimeException("Your stack is empty.");
}
this.stackMin.pop();
return this.stackData.pop();
}
public int getmin() {
if (this.stackMin.isEmpty()) {
throw new RuntimeException("Your stack is empty.");
}
return this.stackMin.peek();
}
}
public static void main(String[] args) {
MyStack stack = new MyStack();
stack.push(3);
System.out.println(stack.getmin()); //3
stack.push(4);
System.out.println(stack.getmin()); //3
stack.push(1);
System.out.println(stack.getmin()); //1
System.out.println(stack.pop()); //1
System.out.println(stack.getmin()); //3
}
}