Leetcode题解之 —— 最小栈

思路

数组思想

题解

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
/**
 * initialize your data structure here.
 */
var MinStack = function() {
  this.stack = [];

  function createNew() {
    return new MinStack();
  }
};

/**
 * @param {number} x
 * @return {void}
 */
MinStack.prototype.push = function(x) {
  this.stack.push(x);
};

/**
 * @return {void}
 */
MinStack.prototype.pop = function() {
  this.stack.pop();
};

/**
 * @return {number}
 */
MinStack.prototype.top = function() {
  return this.stack[this.stack.length - 1];
};

/**
 * @return {number}
 */
MinStack.prototype.getMin = function() {
  return this.stack.reduce((total, current) => {
    total = current < total ? current : total;
    return total;
  }, Number.MAX_VALUE);
};