-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathminStack.js
More file actions
54 lines (47 loc) · 1.31 KB
/
minStack.js
File metadata and controls
54 lines (47 loc) · 1.31 KB
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
/**
* LeetCode 155. Min Stack
* https://leetcode.com/problems/min-stack/
*
* Design a stack that supports push, pop, top, and retrieving the minimum
* element in constant time.
*
* Implement the MinStack class:
* - MinStack() initializes the stack object.
* - void push(val) pushes the element val onto the stack.
* - void pop() removes the element on the top of the stack.
* - int top() gets the top element of the stack.
* - int getMin() retrieves the minimum element in the stack.
*
* You must implement a solution with O(1) time complexity for each function.
*/
const MinStack = function () {
this.stack = [];
this.minStack = [];
};
/** * @param {number} val
* @return {void}
*/
MinStack.prototype.push = function (val) {
this.stack.push(val);
if (this.minStack.length === 0) {
this.minStack.push(val);
} else {
const currentMin = this.minStack[this.minStack.length - 1];
this.minStack.push(Math.min(val, currentMin));
}
};
/* @return {void}
*/
MinStack.prototype.pop = function () {
this.stack.pop();
this.minStack.pop();
};
/* @return {number} */
MinStack.prototype.top = function () {
return this.stack[this.stack.length - 1];
};
/* @return {number} */
MinStack.prototype.getMin = function () {
return this.minStack[this.minStack.length - 1];
};
module.exports = { MinStack };