【LeetCode】155. Min Stack 最小栈(Easy)(JAVA)
题目地址: https://leetcode.com/problems/min-stack/
题目描述:
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
- push(x) – Push element x onto stack.
- pop() – Removes the element on top of the stack.
- top() – Get the top element.
- getMin() – Retrieve the minimum element in the stack.
Example 1:
Input
["MinStack","push","push","push","getMin","pop","top","getMin"]
[[],[-2],[0],[-3],[],[],[],[]]
Output
[null,null,null,null,-3,null,0,-2]
Explanation
MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin(); // return -3
minStack.pop();
minStack.top(); // return 0
minStack.getMin(); // return -2
Constraints:
- Methods pop, top and getMin operations will always be called on non-empty stacks.
题目大意
设计一个支持 push ,pop ,top 操作,并能在常数时间内检索到最小元素的栈。
- push(x) —— 将元素 x 推入栈中。
- pop() —— 删除栈顶的元素。
- top() —— 获取栈顶元素。
- getMin() —— 检索栈中的最小元素。
提示:
- pop、top 和 getMin 操作总是在 非空栈 上调用。
解题方法
- 用两个 Stack 来存,一个 Stack 正常后入先出,一个 Stack 用来存当前的最小值
- 如果 push 值小于等于 minStack 的 peek() ,就把当前值 push 进 minStack;如果 pop 的时候,pop 出来的值等于 minStack 的 peek() ,就把 minStack 顶部元素 pop 出来
- note: 注意两个 Integer 对象不能用 ‘==’ 比较,对象是比不出相等的
class MinStack {
private Stack<Integer> stack = new Stack<>();
private Stack<Integer> min = new Stack<>();
/** initialize your data structure here. */
public MinStack() {
}
public void push(int x) {
stack.push(x);
if (min.size() == 0 || x <= min.peek()) min.push(x);
}
public void pop() {
Integer cur = stack.pop();
if (cur.compareTo(min.peek()) == 0) min.pop();
}
public int top() {
return stack.peek();
}
public int getMin() {
return min.peek();
}
}
执行耗时:7 ms,击败了78.08% 的Java用户
内存消耗:39.7 MB,击败了98.94% 的Java用户
![](https://img-blog.csdnimg.cn/20201107174624800.jpg?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzE2OTI3ODUz,size_16,color_FFFFFF,t_70#pic_center)