-
-
Notifications
You must be signed in to change notification settings - Fork 155
/
Copy pathfindMiddleNode.js
66 lines (58 loc) · 1.46 KB
/
findMiddleNode.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
class Node {
constructor(value) {
this.value = value;
this.next = null;
}
}
class LinkedList {
constructor(value) {
this.head = null;
this.tail = null;
this.length = 0;
}
push(value) {
const newNode = new Node(value);
if(!this.head) {
this.head = newNode;
this.tail = newNode;
} else {
this.tail.next = newNode;
this.tail = newNode;
}
this.length++;
return this;
}
findMiddleNode() {
let slow = this.head;
let fast = this.head;
while(fast != null && fast.next != null) {
slow = slow.next;
fast = fast.next.next;
}
return slow;
}
findMiddleNodeWithLength() {
let temp = this.head;
for(let i = 0; i < Math.floor(this.length/2); i++) {
temp = temp.next;
}
return temp;
}
}
const myLinkedList1 = new LinkedList();
myLinkedList1.push(1);
myLinkedList1.push(2);
myLinkedList1.push(3);
myLinkedList1.push(4);
myLinkedList1.push(5);
const myLinkedList2 = new LinkedList();
myLinkedList2.push(1);
myLinkedList2.push(2);
myLinkedList2.push(3);
myLinkedList2.push(4);
myLinkedList2.push(5);
myLinkedList2.push(6);
console.log(myLinkedList1.findMiddleNode());
console.log(myLinkedList1.findMiddleNodeWithLength());
console.log(myLinkedList2.findMiddleNode());
console.log(myLinkedList2.findMiddleNodeWithLength());