-
Notifications
You must be signed in to change notification settings - Fork 1
/
链表.html
78 lines (74 loc) · 1.94 KB
/
链表.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<meta http-equiv="X-UA-Compatible" content="ie=edge">
<title>Document</title>
</head>
<body>
</body>
<script>
// 链表查找
function find(item) {
var currNode = this.head;
try {
while (currNode.element != item) {
currNode = currNode.next;
}
} catch (error) {
console.log(typeof error);
}
return currNode;
}
// 显示链表元素
function display() {
var currNode = this.head;
while (!(currNode.next == null)) {
console.log(currNode.next.element);
currNode = currNode.next;
}
}
// find prev Node
function prevNode(item) {
var currNode = this.head;
while (!(currNode.next == null) && (currNode.next.element != item)) {
currNode = currNode.next;
}
return currNode;
}
// remove
function remove() {
var prevNode = this.findPrev(item);
if (!(prevNode === null)) {
prevNode.next = prevNode.next.next;
}
}
// 插入 节点
function insert(newElement, item) {
var newNode = new Node(newElement);
var current = this.find(item);
newNode.next = current.next;
current.next = newNode;
}
// Node 类
function Node(element) {
this.element = element;
this.next = null;
}
// LinkedLise 类
function List() {
this.head = new Node('head');
}
List.prototype.find = find;
List.prototype.insert = insert;
List.prototype.remove = remove;
List.prototype.prevNode = prevNode;
List.prototype.display = display;
const list = new List()
list.insert('222', 'head')
list.insert('333', 'head')
list.insert('444', 'head')
console.log(list);
</script>
</html>