力扣之155. 最小栈

设计一个支持 push ,pop ,top 操作,并能在常数时间内检索到最小元素的栈。

push(x) —— 将元素 x 推入栈中。
pop() —— 删除栈顶的元素。
top() —— 获取栈顶元素。
getMin() —— 检索栈中的最小元素。

示例:

输入:
[“MinStack”,“push”,“push”,“push”,“getMin”,“pop”,“top”,“getMin”]
[[],[-2],[0],[-3],[],[],[],[]]

输出:
[null,null,null,null,-3,null,0,-2]

解释:
MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin(); --> 返回 -3.
minStack.pop();
minStack.top(); --> 返回 0.
minStack.getMin(); --> 返回 -2.

我自个的:

/**
 * initialize your data structure here.
 */
var MinStack = function () {
    this.dataStructure = new Array();
    this.sign = 0;
};

/** 
 * @param {number} x
 * @return {void}
 */
MinStack.prototype.push = function (x) {
    this.dataStructure[this.sign++] = x;
};

/**
 * @return {void}
 */
MinStack.prototype.pop = function () {
    this.dataStructure = this.dataStructure.splice(0, this.dataStructure.length - 1);
    this.sign--;
};

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

/**
 * @return {number}
 */
MinStack.prototype.getMin = function () {
    let array = new Array()
    this.dataStructure.forEach(function (value) {
        array.push(value);
    })
    return array.sort(sortNumber)[this.sign - 1]
};

function sortNumber(a, b) {
    return b - a
};
/**
 * 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.getMin()
 */

数据量不大时还行。。。大就超时了。。。

/**
 * initialize your data structure here.
 */
let stack = new Array();
let min_stack = new Array();
var MinStack = function () {
    stack = [];
    min_stack = [];
};

/** 
 * @param {number} x
 * @return {void}
 */
MinStack.prototype.push = function (x) {
    stack.push(x);
    // 因为栈中进行查找操作不好,所以将与顶部元素相等的x也push
    if (!min_stack.length || x <= min_stack[min_stack.length - 1]) {
        min_stack.push(x);
    }
};

/**
 * @return {void}
 */
MinStack.prototype.pop = function () {
    if (min_stack[min_stack.length - 1] == stack.pop()) {
        min_stack.pop();
    }
    // stack.pop(); // 因为上面的判断语句中已经执行过一次pop,若按逻辑下面的写法也可以。但是会多一次资源请求调用
    // if (min_stack[min_stack.length - 1] == stack[stack.length - 1]) {
    //     min_stack.pop();
    // }
    // stack.pop();
};

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

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

/**
 * 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.getMin()
 */
已标记关键词 清除标记
©️2020 CSDN 皮肤主题: 书香水墨 设计师:CSDN官方博客 返回首页