题解 | #包含min函数的栈#

var stack = [];
function push(node)
{
    // write code here
    // console.log(node)
    stack.push(node);
}
function pop()
{
    // write code here
    if(stack.length != 0){
        stack.pop()
    }
}
function top()
{
    // write code here
    if(stack.length != 0){
        return stack[stack.length-1];
    }
}
function min()
{
    // write code here
    // console.log(Math.min(...stack))
    return Math.min(...stack); //ES6扩展运算符
}
module.exports = {
    push : push,
    pop : pop,
    top : top,
    min : min
};