forked from knaxus/problem-solving-javascript
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.js
125 lines (105 loc) · 2.03 KB
/
index.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
class Node {
constructor(data, next) {
this.data = data;
this.next = next;
}
}
class LinkedList {
constructor() {
this.head = null;
}
addAtBeginning(element) {
this.head = new Node(element, this.head);
}
addAtEnd(element) {
const node = new Node(element, null);
if (!this.head) {
this.head = node;
} else {
let address = this.head;
while (address.next) {
address = address.next;
}
address.next = node;
}
}
removeFromBeginning() {
if (!this.head) {
return null;
}
const temp = this.head;
this.head = this.head.next;
return temp.data;
}
removeFromEnd() {
if (!this.head) {
return null;
}
let address = this.head;
while (address.next.next) {
address = address.next;
}
const { data } = address.next;
address.next = null;
return data;
}
getFirst() {
if (!this.head) {
return null;
}
return this.head;
}
getLast() {
if (!this.head) {
return null;
}
let address = this.head;
while (address.next) {
address = address.next;
}
return address;
}
getAt(index) {
if (!this.length()) {
return null;
}
let address = this.head;
let count = index;
while (count && address.next) {
address = address.next;
count -= 1;
}
return address;
}
addAt(index, element) {
if (!this.head) {
return this.addAtBeginning(element);
}
if (index >= this.length()) {
return this.addAtEnd(element);
}
let address = this.head;
let previous = this.head;
let count = index;
while (count) {
previous = address;
address = address.next;
count -= 1;
}
previous.next = new Node(element, previous.next);
return 0;
}
length() {
let address = this.head;
let count = 0;
while (address) {
count += 1;
address = address.next;
}
return count;
}
delete() {
this.head = null;
}
}
module.exports = { LinkedList, Node };