LeetCode 题解：155. 最小栈，单个栈 + 对象存储，JavaScript，详细注释

/**
 * @param {number} x
 * @return {void}
 */
MinStack.prototype.push = function(x) {
  // 如果当前栈为空，则直接存储
  if (!this.stack.length) {
    this.stack.push({
      value: x,
      min: x,
    });
  } else {
    // 对比当前最小值，进行存储
    this.stack.push({
      value: x,
      min: Math.min(x, this.stack[this.stack.length - 1].min),
    });
  }
};
/**
 * @return {void}
 */
MinStack.prototype.pop = function () {
  this.stack.pop();
};
/**
 * @return {number}
 */
MinStack.prototype.top = function () {
  return this.stack[this.stack.length - 1].value;
};
/**
 * @return {number}
 */
MinStack.prototype.getMin = function () {
  return this.stack[this.stack.length - 1].min;
};