-
Notifications
You must be signed in to change notification settings - Fork 40
/
Copy pathMinStack.js
81 lines (74 loc) · 1.73 KB
/
MinStack.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
// Source : https://leetcode.com/problems/min-stack
// Author : Dean Shi
// Date : 2017-03-11
/***************************************************************************************
*
* 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:
*
* MinStack minStack = new MinStack();
* minStack.push(-2);
* minStack.push(0);
* minStack.push(-3);
* minStack.getMin(); --> Returns -3.
* minStack.pop();
* minStack.top(); --> Returns 0.
* minStack.getMin(); --> Returns -2.
*
*
***************************************************************************************/
/**
* initialize your data structure here.
*/
var MinStack = function() {
this.stack = []
};
/**
* @param {number} x
* @return {void}
*/
MinStack.prototype.push = function(x) {
const min = this.stack.length > 0
? this.stack[this.stack.length - 1].min
: Number.MAX_SAFE_INTEGER
this.stack.push({
val: x,
min: Math.min(min, x)
})
};
/**
* @return {void}
*/
MinStack.prototype.pop = function() {
this.stack.pop()
};
/**
* @return {number}
*/
MinStack.prototype.top = function() {
return this.stack[this.stack.length - 1].val
};
/**
* @return {number}
*/
MinStack.prototype.getMin = function() {
return this.stack[this.stack.length - 1].min
};
/**
* Your MinStack object will be instantiated and called as such:
* var obj = Object.create(MinStack).createNew()
* obj.push(x)
* obj.pop()
* var param_3 = obj.top()
* var param_4 = obj.getMin()
*/