-
Notifications
You must be signed in to change notification settings - Fork 0
/
linkedList.js
167 lines (151 loc) · 3.07 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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
class Node {
constructor(value = null, nextNode = null) {
this.value = value;
this.nextNode = nextNode;
}
}
class LinkedList {
constructor() {
this.head = null;
}
append(value) {
if (this.head === null) {
this.head = new Node(value);
return;
}
let current = this.head;
while (current.nextNode !== null) {
current = current.nextNode;
}
current.nextNode = new Node(value);
}
prepend(value) {
const newHead = new Node(value, this.head);
this.head = newHead;
}
size() {
let count = 0;
let current = this.head;
while (current !== null) {
count++;
current = current.nextNode;
}
return count;
}
head() {
return this.head;
}
tail() {
let current = this.head;
while (current.nextNode !== null) {
current = current.nextNode;
}
return current;
}
at(index) {
let count = 0;
let current = this.head;
while (current !== null) {
if (count === index) {
return current;
}
count++;
current = current.nextNode;
}
return null;
}
pop() {
let current = this.head;
let previous = null;
while (current.nextNode !== null) {
previous = current;
current = current.nextNode;
}
previous.nextNode = null;
}
contains(value) {
let current = this.head;
while (current !== null) {
if (current.value === value) {
return true;
}
current = current.nextNode;
}
return false;
}
find(value) {
let index = 0;
let current = this.head;
while (current !== null) {
if (current.value === value) {
return index;
}
current = current.nextNode;
index++;
}
return null;
}
toString() {
let current = this.head;
let str = '';
while (current !== null) {
str += '( ' + current.value + ' ) -> ';
if (current.nextNode == null) {
str += 'null';
}
current = current.nextNode;
}
return str;
}
insertAt(value, insertIndex) {
let currentIndex = 0;
let current = this.head;
let previous = null;
while (current !== null) {
if (currentIndex === insertIndex) {
const newNode = new Node(value, current);
previous.nextNode = newNode;
return;
}
currentIndex++;
previous = current;
current = current.nextNode;
}
}
removeAt(removeIndex) {
let currentIndex = 0;
let current = this.head;
let previous = null;
while (current !== null) {
if (currentIndex === removeIndex) {
previous.nextNode = current.nextNode;
return;
}
currentIndex++;
previous = current;
current = current.nextNode;
}
}
}
let list = new LinkedList();
list.append(1);
list.append(2);
list.append(3);
list.append("Hello");
console.log(list.toString());
console.log('Size : ', list.size());
console.log('Head : ', list.head);
console.log('Tail : ', list.tail());
console.log('At 2 : ', list.at(2));
list.pop();
console.log(list.toString());
console.log('Contains 2 : ', list.contains(2));
console.log('Find 2 : ', list.find(2));
list.prepend(0);
console.log(list.toString());
console.log('Contains 0 : ', list.contains(0));
console.log('Find 0 : ', list.find(0));
list.insertAt(4, 2);
console.log(list.toString());
list.removeAt(2);
console.log(list.toString());