1,原文
https://leetcode-cn.com/problems/min-stack/
2,题目
设计一个支持 push ,pop ,top 操作,并能在常数时间内检索到最小元素的栈。
push(x) —— 将元素 x 推入栈中。
pop() —— 删除栈顶的元素。
top() —— 获取栈顶元素。
getMin() —— 检索栈中的最小元素。
示例:
MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin(); --> 返回 -3.
minStack.pop();
minStack.top(); --> 返回 0.
minStack.getMin(); --> 返回 -2.
3.源码一
import java.util.Stack;
//leetcode submit region begin(Prohibit modification and deletion)
class MinStack {
private Stack<Integer> stack;
private Stack<Integer> miniStack;
/** initialize your data structure here. */
public MinStack() {
stack = new Stack<>();
miniStack= new Stack<>();
}
public void push(int x) {
stack.push(x);
if(!miniStack.isEmpty()){
int top = miniStack.peek();
if(x <= top){
miniStack.push(x);
}
}else{
miniStack.push(x);
}
}
public void pop() {
int x = stack.pop();
int top = miniStack.peek();
if(x == top){
miniStack.pop();
}
}
public int top() {
return stack.peek();
}
public int getMin() {
return miniStack.peek();
}
}
4,源码二
class MinStack {
private int min = Integer.MAX_VALUE;
private Stack<Integer> stack;
/** initialize your data structure here. */
public MinStack() {
stack = new Stack<>();
}
public void push(int x) {
if(x<= min){
stack.push(min);
min = x;
}
stack.push(x);
}
public void pop() {
if(stack.pop() == min){
min = stack.pop();
}
}
public int top() {
return stack.peek();
}
public int getMin() {
return min;
}
}