最小栈
描述
- 设计一个支持 push ,pop ,top 操作,并能在常数时间内检索到最小元素的栈
- 实现 MinStack 类:
- MinStack() 初始化堆栈对象
- void push(int val) 将元素val推入堆栈
- void pop() 删除堆栈顶部的元素
- int top() 获取堆栈顶部的元素
- int getMin() 获取堆栈中的最小元素
示例 1
输入:
["MinStack","push","push","push","getMin","pop","top","getMin"]
[[],[-2],[0],[-3],[],[],[],[]]
输出:
[null,null,null,null,-3,null,0,-2]
解释:
MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin(); --> 返回 -3.
minStack.pop();
minStack.top(); --> 返回 0.
minStack.getMin(); --> 返回 -2.
提示
- - 2 31 2^{31} 231 <= val <= 2 31 2^{31} 231 - 1
- pop、top 和 getMin 操作总是在 非空栈 上调用
- push, pop, top, and getMin最多被调用 3 * 1 0 4 10^4 104 次
Typescript 版算法实现
1 ) 方案1:辅助栈
class MinStack {
x_stack = []
min_stack = [Infinity];
push(val: number): void {
this.x_stack.push(val);
this.min_stack.push(Math.min(this.min_stack[this.min_stack.length - 1], val));
}
pop(): void {
this.x_stack.pop();
this.min_stack.pop();
}
top(): number {
return this.x_stack[this.x_stack.length - 1];
}
getMin(): number {
return this.min_stack[this.min_stack.length - 1];
}
}
/**
* Your MinStack object will be instantiated and called as such:
* var obj = new MinStack()
* obj.push(val)
* obj.pop()
* var param_3 = obj.top()
* var param_4 = obj.getMin()
*/
2 ) 方案2: 第二个版本
class MinStack {
stack = []
mins = []
push(val: number): void {
this.stack.push(val)
this.mins.push(this.mins.length ? Math.min(last(this.mins), val) : val)
}
pop(): void {
this.stack.pop()
this.mins.pop()
}
top(): number {
return this.stack[this.stack.length - 1]
}
getMin(): number {
return last(this.mins)
}
}
function last(arr) {
return arr[arr.length - 1]
}
/**
* Your MinStack object will be instantiated and called as such:
* var obj = new MinStack()
* obj.push(val)
* obj.pop()
* var param_3 = obj.top()
* var param_4 = obj.getMin()
*/
1281



被折叠的 条评论
为什么被折叠?



