【数据结构连载一线性表】【双向循环链表】javascript

function Node() {
    this.data = null;
    this.next = null;
    this.pre = null;
}

function DoubleCycleLinkedList() {
    this.length = 0;
    this.head = new Node();
    this.head.pre = this.head;
    this.head.next = this.head;
    this.tail = function () {
        return this.head.pre;
    }
    this.empty = function () {
        return this.head.next === this.head;
    };
    this.exist = function (value) {
        let cur = this.head.next;
        while (cur !== this.head) {
            if (cur.data === value) {
                return true;
            }
            cur = cur.next;
        }
        return false
    };
    this.get = function (index) {
        if (index >= this.length) {
            throw new Error("下标越界")
        }
        let cur = this.head.next;
        let n = 0;
        while (cur !== this.head) {
            if (n === index) {
                return cur.data
            }
            cur = cur.next
            n++
        }
    };
    this.add = function (value) {
        const new_node = new Node();
        new_node.data = value;
        new_node.next = this.head.next;
        new_node.pre = this.head;
        this.head.next.pre = new_node;
        this.head.next = new_node;
        this.length++;
    };

    this.append = function (value) {
        const new_node = new Node();
        new_node.data = value;
        new_node.next = this.head;
        new_node.pre = this.head.pre;
        this.head.pre.next = new_node;
        this.head.pre = new_node;
        this.length++;
    };
    this.show = function () {
        let cur = this.head.next;
        let s = "";
        while (cur !== this.head) {
            s += cur.data + " "
            cur = cur.next;
        }
        console.log(s)
    };
    this.insert = function (index, value) {
        if (index < 0) {
            throw new Error("插入位置错误");
        }
        const new_node = new Node();
        new_node.data = value;
        let n = 0;
        let cur = this.head;
        while (cur.next !== this.head) {
            if (n === index) {
                break
            }
            n++;
            cur = cur.next;
        }
        new_node.next = cur.next;
        new_node.pre = cur;
        cur.next.pre = new_node;
        cur.next = new_node;
        this.length++;
    };
    this.index = function (value) {
        let cur = this.head.next;
        let n = 0;
        while (cur !== this.head) {
            if (cur.data === value) {
                return n
            }
            cur = cur.next;
            n++;
        }
        return -1
    };
    this.delete = function (index) {
        if (index >= this.length) {
            throw new Error("下标越界:" + index);
        }
        let cur = this.head;
        let n = 0;
        while (cur.next !== this.head) {
            if (n === index) {
                cur.next.pre = cur;
                cur.next = cur.next.next;
                this.length--;
                return
            }
            n++;
            cur = cur.next;
        }
    };
    this.remove = function (value) {
        let cur = this.head;
        while (cur.next !== this.head) {
            if (cur.next.data === value) {
                cur.next.pre = cur;
                cur.next = cur.next.next;
                this.length--;
                return;
            }
            cur = cur.next;
        }
        throw new Error("删除数据不存在" + value);
    };
    this.pop = function () {
        if (!this.head.next) {
            throw new Error("链表为空")
        }
        let cur = this.head.pre;
        const data = cur.data;
        cur.pre.next = this.head;
        this.head.pre = cur.pre;
        this.length--;
        return data;
    }
}


l = new DoubleCycleLinkedList();
l.add(10)
l.add(9)
l.add(8)
l.append(1)
l.append(2)
l.show()
l.insert(1, 4)
l.show()
console.log(l.index(3))
// l.remove(2)
console.log(l.pop())
console.log(l.pop())
console.log(l.pop())
console.log(l.tail().data)
l.show()