-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlinked-list.js
More file actions
192 lines (163 loc) · 5.05 KB
/
linked-list.js
File metadata and controls
192 lines (163 loc) · 5.05 KB
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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
class Node{
constructor(value = null, nextNode = null) {
this.value = value;
this.nextNode = nextNode;
}
}
class LinkedList{
constructor() {
this.headNode = null;
}
append(value) {
if (this.headNode === null)
this.prepend(value);
else {
let currentNode = this.headNode;
while (currentNode.nextNode !== null) {
currentNode = currentNode.nextNode;
};
currentNode.nextNode = new Node(value);
};
}
prepend(value) {
this.headNode = new Node(value, this.headNode);
}
size() {
let count = 0
if (this.headNode === null)
return count;
else {
let currentNode = this.headNode;
while (currentNode.nextNode !== null) {
count += 1;
currentNode = currentNode.nextNode;
};
count += 1;
return count;
}
}
head() {
if (this.headNode === null)
return undefined;
else
return this.headNode.value;
}
tail() {
if (this.headNode === null)
return undefined;
else {
let currentNode = this.headNode;
while (currentNode.nextNode !== null) {
currentNode = currentNode.nextNode;
};
return currentNode.value;
}
}
at(index) {
if (this.headNode === null || index < 0)
return undefined;
else {
let currentNode = this.headNode;
for (let i=0; i<index; i++) {
if (currentNode.nextNode !== null)
currentNode = currentNode.nextNode;
else return undefined;
};
return currentNode.value;
}
}
pop() {
if (this.headNode === null)
return undefined;
else {
const oldHeadNode = this.headNode;
this.headNode = this.headNode.nextNode;
oldHeadNode.nextNode = null;
return oldHeadNode.value;
}
}
contains(value) {
if (this.headNode === null)
return false;
else {
let currentNode = this.headNode;
while (currentNode.nextNode !== null) {
if (currentNode.value === value) return true;
else currentNode = currentNode.nextNode;
};
if (currentNode.value === value) return true;
else return false ;
};
}
findIndex(value) {
if (this.headNode === null)
return -1;
else {
let currentNode = this.headNode;
let index = 0
while (currentNode.nextNode !== null) {
if (currentNode.value === value)
return index;
else {
currentNode = currentNode.nextNode
index += 1
}
};
if (currentNode.value === value) return index;
else return -1;
}
}
toString() {
let listAsString = ""
if (this.headNode === null)
return "this list is empty";
else {
let currentNode = this.headNode;
while (currentNode.nextNode !== null) {
listAsString += `( ${currentNode.value} ) -> `;
currentNode = currentNode.nextNode;
};
listAsString += `( ${currentNode.value} ) -> `;
return listAsString += "null";
};
}
insertAt(index, ...values) {
const listSize = this.size();
if (index < 0 || index > listSize)
throw RangeError(`requested index: ${index} | placeable index: 0 - ${listSize}`);
function insertValues(i, currentNode) {
for (i; i < values.length; i++) {
currentNode.nextNode = new Node(values[i], currentNode.nextNode);
currentNode = currentNode.nextNode;
}
}
if (this.headNode === null || index === 0) {
this.prepend(values[0]);
insertValues(1, this.headNode);
} else {
let currentNode = this.headNode;
for (let i = 1; i < index; i++) {
currentNode = currentNode.nextNode;
};
insertValues(0, currentNode);
}
}
RemoveAt(index) {
const listSize = this.size();
if (index < 0 || index > listSize)
throw RangeError(`requested index: ${index} | indexed: 0 - ${listSize - 1}`);
if (index === 0)
return this.pop();
else {
let currentNode = this.headNode;
for (let i = 1; i < index; i++) {
currentNode = currentNode.nextNode;
};
const nodeToRemove = currentNode.nextNode;
currentNode.nextNode = nodeToRemove.nextNode;
nodeToRemove.nextNode = null;
return nodeToRemove.value;
}
}
}
module.exports = LinkedList;