-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy path155.最小栈.js
95 lines (87 loc) · 1.94 KB
/
155.最小栈.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
/*
* @lc app=leetcode.cn id=155 lang=javascript
*
* [155] 最小栈
*
* https://leetcode-cn.com/problems/min-stack/description/
*
* algorithms
* Easy (50.13%)
* Likes: 391
* Dislikes: 0
* Total Accepted: 75.7K
* Total Submissions: 146.5K
* Testcase Example: '["MinStack","push","push","push","getMin","pop","top","getMin"]\n' +
'[[],[-2],[0],[-3],[],[],[],[]]'
*
* 设计一个支持 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.
*
*
*/
// @lc code=start
/**
* initialize your data structure here.
*/
var MinStack = function () {
this.stack = []
this.min = Number.MAX_SAFE_INTEGER
};
/**
* @param {number} x
* @return {void}
*/
MinStack.prototype.push = function (x) {
if (this.min >= x) {
this.stack.push(this.min)
this.min = x
}
this.stack.push(x)
};
/**
* @return {void}
*/
MinStack.prototype.pop = function () {
// 如果弹出值 == 当前最小值,那么再弹一次的值为上一个最小值也即出栈后更新的最小值
if (this.stack.pop() == this.min) {
this.min = this.stack.pop();
}
};
/**
* @return {number}
*/
MinStack.prototype.top = function () {
return this.stack[this.stack.length - 1]
};
/**
* @return {number}
*/
MinStack.prototype.getMin = function () {
return this.min
};
/**
* Your MinStack object will be instantiated and called as such:
* var obj = new MinStack()
* obj.push(x)
* obj.pop()
* var param_3 = obj.top()
* var param_4 = obj.getMin()
*/
// @lc code=end