-
Notifications
You must be signed in to change notification settings - Fork 2
/
LinkedList.js
153 lines (140 loc) · 3.81 KB
/
LinkedList.js
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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
// Single LinkedList
function LinkedList() {
let length = 0;
let head = null;
let Node = function (element) {
this.element = element;
this.next = null;
};
this.size = function () {
return length;
};
this.head = function () {
return head;
};
this.add = function (element) {
let node = new Node(element);
if (head === null) {
head = node;
} else {
currentNode = head;
while (currentNode.next) {
currentNode = currentNode.next;
}
currentNode.next = node;
}
length++;
};
this.remove = function (e) {
if (head.element === e) {
head = head.next;
length--;
return;
} else {
let currentNode = head;
let prevNode;
while (currentNode.next) {
if (currentNode.element === e) {
break;
}
prevNode = currentNode;
currentNode = currentNode.next;
}
prevNode.next = currentNode.next;
return;
}
};
this.isEmpty = function () {
return length === 0;
};
this.indexOf = function (element) {
let currentNode = head;
for (let i = 0; i < length; i++) {
if (currentNode.element === element) {
return i;
} else {
currentNode = currentNode.next;
}
}
return -1;
};
this.elementAt = function (index) {
if (head === null) {
return undefined;
} else {
let currentNode = head;
let count = -1;
while (currentNode) {
count++;
if (count === index) {
return currentNode.element;
}
currentNode = currentNode.next;
}
return undefined;
}
};
this.removeAt = function (index) {
if (head === null) {
return null;
} else if (index === 0) {
let item = head;
head = head.next;
length--;
return item.element;
} else {
let currentNode = head;
let count = -1;
let prevNode;
while (currentNode) {
count++;
if (count === index) {
let item = currentNode;
prevNode.next = currentNode.next;
length--;
return item.element;
}
prevNode = currentNode;
currentNode = currentNode.next;
}
return null;
}
};
this.addAt = function (index, e) {
let currentNode = head;
let prevNode;
let node = new Node(e);
if (!currentNode && index > 0) return false;
for (let i = 0; i < length + 1; i++) {
if (index === 0) {
node.next = currentNode;
head = node;
length++;
return;
}
if (i === index) {
prevNode.next = node;
node.next = currentNode;
length++;
return;
}
if (!currentNode) return false;
prevNode = currentNode;
currentNode = currentNode.next;
}
return false;
};
this.reverse = function () {
let currentNode = head;
let savedNode;
let prevNode;
while (currentNode) {
savedNode = currentNode.next;
currentNode.next = prevNode;
prevNode = currentNode;
currentNode = savedNode;
}
head = prevNode;
return head;
};
}