function Node() {
this.data = null;
this.next = null;
}
function LinkedList() {
this.length = 0;
this.head = new Node();
this.tail = this.head;
this.empty = function () {
return this.length === 0
};
this.exist = function (value) {
let cur = this.head;
while (cur) {
if (cur.data === value) {
return true;
}
cur = cur.next;
}
return false
};
this.get = function (index) {
if (index >= l.length) {
throw new Error("下标越界")
}
let cur = l.head.next;
let n = 0;
while (cur) {
if (n === index) {
return cur.data
}
cur = cur.next
n++
}
};
this.add = function (value) {
let cur = this.head;
const new_node = new Node();
new_node.data = value;
new_node.next = cur.next;
if (this.head === this.tail) {
this.tail = new_node;
}
this.head.next = new_node;
this.length++;
};
this.append = function (value) {
const new_node = new Node();
new_node.data = value;
this.tail.next = new_node;
this.tail = new_node;
this.length++;
};
this.show = function () {
let cur = this.head.next;
let s = "";
while (cur) {
s += cur.data + " "
cur = cur.next;
}
console.log(s)
};
this.insert = function (index, value) {
if (index >= this.length) {
const new_node = new Node();
new_node.data = value;
this.tail.next = new_node;
this.tail = new_node;
this.length++;
return;
}
let cur = this.head;
let n = 0;
while (cur) {
if (n === index) {
new_node.next = cur.next;
cur.next = new_node;
this.length++;
break
}
cur = cur.next;
n++;
}
};
this.index = function (value) {
let cur = this.head.next;
let n = 0;
while (cur) {
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 && cur.next) {
if (n === index) {
cur.next = cur.next.next;
this.length--;
if (n === this.length) {
this.tail = cur;
}
}
n++;
cur = cur.next;
}
};
this.remove = function (value) {
let pre = this.head;
let cur = pre.next;
let n = 1;
while (pre && cur) {
if (cur.data === value) {
pre.next = cur.next;
if (n === this.length) {
this.tail = pre;
}
this.length--;
return
}
pre = pre.next;
cur = cur.next;
n++;
}
throw new Error("删除数据不存在" + value);
};
this.pop = function () {
let cur = this.head;
while (cur && cur.next && cur.next.next) {
cur = cur.next;
}
const data = cur.next.data;
cur.next = cur.next.next;
this.tail = cur
this.length--;
return data;
}
}
l = new LinkedList();
l.add(10)
l.append(1)
l.insert(3, 19)
console.log(l.tail)
l.show()
console.log(l.get(1))