剑指 Offer(23) ——包含min函数的栈

题目
定义栈的数据结构，请在该类型中实现一个能够得到栈的最小元素的 min 函数在该栈中，调用 min、push 及 pop 的时间复杂度都是 O(1)。

示例:

MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.min(); --> 返回 -3.
minStack.pop();
minStack.top(); --> 返回 0.
minStack.min(); --> 返回 -2.

代码

/**
 * initialize your data structure here.
 */
var MinStack = function() {
    this.stack=[];
    this.minst=[];
    this.minval=0;
};

/** 
 * @param {number} x
 * @return {void}
 */
MinStack.prototype.push = function(x) {
    if(!this.stack.length) this.minval = x;
    this.stack.push(x)
    if(x<this.minval) this.minval=x;
    this.minst.push(this.minval)
};

/**
 * @return {void}
 */
MinStack.prototype.pop = function() {
    this.stack.pop();
    this.minst.pop();
    const length = this.minst.length;
    if (length) {
        this.minval=this.minst[length-1];
    }
};

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

/**
 * @return {number}
 */
MinStack.prototype.min = function() {
    const length = this.minst.length;
    if (length) {
        return this.minst[length - 1];
    } else {
        return null;
    }
};

/**
 * 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.min()
 */