JavaScript数据结构,栈 Stack

JavaScript数据结构,栈 Stack

Stack 定义

function Stack() {
    this.dataStore = [];
    this.top = 0;
    this.push = push;
    this.pop = pop;
    this.peek = peek;
    this.clear = clear;
    this.length = length;
}

Stack 类

function Stack() {
    this.dataStore = [];
    this.top = 0;
    this.push = push;
    this.pop = pop;
    this.peek = peek;
    this.clear = clear;
    this.length = length;
}
function push(element) {
    this.dataStore[this.top++] = element;
}
function pop() {
    if (this.top > 0) {
        var ele = this.dataStore[--this.top];
        if (this.top === 0) {
            this.clear();
        }
        return ele;
    }
    return undefined;
}
function peek() {
    var ele = this.dataStore[this.top - 1];
    return ele;
}
function clear() {
    this.dataStore = [];
    this.top = 0;
}
function length() {
    return this.top;
}
// 测试
var s = new Stack();
s.push("David");
s.push("Bryan");
console.log("length: " + s.length());
s.pop();
s.peek();
s.pop();
console.log("length: " + s.length());

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值