-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.js
92 lines (71 loc) · 1.35 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
const debug = require('debug')('LinkedListCycle2');
class ListNode {
constructor(val) {
this.val = val;
this.next = null;
}
}
const headNode = new ListNode(1);
let currentNode = headNode;
let secondNode;
let lastNode;
for (let i = 2; i <= 5; i += 1) {
currentNode.next = new ListNode(i);
if (i === 2) {
secondNode = currentNode.next;
}
if (i === 5) {
lastNode = currentNode.next;
}
currentNode = currentNode.next;
}
// if (secondNode && lastNode) {
// lastNode.next = secondNode;
// }
if (lastNode) {
lastNode.next = headNode;
}
debug(headNode);
const detectCycle = (head) => {
let begin = null;
const nodes = [];
let cur = head;
while (cur) {
if (nodes.includes(cur)) {
begin = cur;
break;
}
nodes.push(cur);
cur = cur.next;
}
return begin;
};
// const b = detectCycle(headNode);
// debug(b);
const detectCycle2 = (head) => {
let slow = head;
let fast = head;
let isCycle = false;
while (slow !== null && fast !== null) {
slow = slow.next;
if (fast.next === null) {
return null;
}
fast = fast.next.next;
if (slow === fast) {
isCycle = true;
break;
}
}
if (!isCycle) {
return null;
}
let h = head;
while (h !== fast) {
h = h.next;
fast = fast.next;
}
return h;
};
const b2 = detectCycle2(headNode);
debug(b2);