面试题 03.02. 栈的最小值
地址:https://leetcode-cn.com/problems/min-stack-lcci/
请设计一个栈,除了常规栈支持的pop与push函数以外,还支持min函数,该函数返回栈元素中的最小值。执行push、pop和min操作的时间复杂度必须为O(1)。
示例:
MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin(); --> 返回 -3.
minStack.pop();
minStack.top(); --> 返回 0.
minStack.getMin(); --> 返回 -2.
解题思路:
当要压入栈的元素小于等于当前最小值时,在压入x之前,先将min压入栈,再将x赋给min;
当要弹出最小值时,弹出两次,再将次小值赋予最小值;
class MinStack {
private Stack<Integer> stack;
private Integer min;
/** initialize your data structure here. */
public MinStack() {
stack = new Stack<>();
min = Integer.MAX_VALUE;
}
public void push(int x) {
// 当x<=min时,在压入x之前,先压入次小值
if (x <= min) {
stack.push(min);
min = x;
}
stack.push(x);
}
public void pop() {
// 当弹出的时最小值的时候,先将最小值弹出,然后把次小值赋给min
if (min.equals(stack.pop())) {
min = stack.pop();
}
}
public int top() {
return stack.peek();
}
public int getMin() {
return min;
}
}
/**
* Your MinStack object will be instantiated and called as such:
* MinStack obj = new MinStack();
* obj.push(x);
* obj.pop();
* int param_3 = obj.top();
* int param_4 = obj.getMin();
*/
Cest la vie!