使用js封装一个循环链表

直接不说废话,直接上代码,这里继承了单向链表的类LinkList ,可以查看之前的文章,点这里

class Node {
    constructor(element) {
        this.element = element;
        this.next = null;
    }
}

class CirularLinkedList extends LinkList {
    constructor() {
        super();
    }

    push(element) {
        const node = new Node(element);
        let current;
        if (this.head === null) {
            this.head = node;
        } else {
            current = this.getNodeAt(this.size() - 1);
            console.log(current);
            current.next = node;
            node.next = this.head;
        }
        node.next = this.head;
        this.count++;
    }

    insert(element, index) {
        if (index >= 0 && index <= this.count) {
            const node = new Node(element);
            let current = this.head;
            if (index === 0) {
                if (this.head === null) {
                    this.head = node;
                    node.next = this.head;
                } else {
                    node.next = current;
                    current = this.getNodeAt(this.size() - 1);
                    this.head = node;
                    console.log(current);
                    current.next = this.head;
                }
            } else {
                const previous = this.getNodeAt(index - 1);
                node.next = previous.next;
                previous.next = node;
            }
            this.count++;
            return true
        }
        return false
    }


    removeAt(index) {
        if (index >= 0 && index < this.count) {
            let current = this.head;
            if (index === 0) {
                if (this.size() === 0) {
                    this.head = undefined;
                } else {
                    let last = this.getNodeAt(this.size() - 1);
                    this.head = this.head.next;
                }
            } else {
                const previous = thsi.getNodeAt(index - 1);
                current = previous.next;
                previous.next = current;
            }
        }
    }
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值