js 实现链表

js 实现链表

function LinkedList() {
    this.Node = function(item) {
        this.item = item;
        this.next = null;
    }
    // let node = new Node();
    let length = 0;
    let head = null;
    this.append = function(item) {
        var node = new this.Node(item),
            current;
        if(head == null) {
            head = node;
        }else {
            current = head;
            while(current.next) {
                current = current.next;
            }
            current.next = node;
        }
        length ++;
        return node;
    }
    this.insert = function(position,item) {
        if(position >= 0 && position <= length) {
            var node = new this.Node(item),
                current = head,
                previous,
                index = 0;
            if(position == 0) {
                node.next = current;
                head = node;
            }else {
                while(index++ < position) {
                    previous = current;                            
                    current = current.next;
                }
                node.next = current;
                previous.next = node;
            }
            length ++;
            return true;
        }else {
            return false;
        }
    }
    this.removeAt = function(position) {
        if(position >= 0 && position <= length) {
            let current = head,
                previous,
                index = 0;
            if(position == 0) {
                head = current.next;
            }else {
                while(index++ < position) {
                    previous = current;
                    current = current.next;
                }
                previous.next = current.next;
            }
            length--;
            return current.item;
        }else {
            return null;
        }
    }
    this.remove = function(item) {
        let index = this.indexOf(item);
        return this.removeAt(index);
    }
    this.indexOf = function(item) {
        let current = head,
            index = 0;
        while(current) {
            if(current.item === item) {
                return index;
            }
            index++;
            current = current.next;
        }
        return -1;
    }
    this.isEmpty = function() {
        return length === 0;
    }
    this.size = function() {
        return length;
    }
    this.toString = function() {
        let current = head,
            string = '';
        while(current) {
            string += current.item;
            current = current.next;
        }
        return string;
    }
    this.getHead = function() {
        return head;
    }
    this.print = function() {
        let current = head;
        while(current.next) {
            console.log(current);
            current = current.next;
        }
    }
}  
let list = new LinkedList();
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值