-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathindex.js
More file actions
79 lines (59 loc) · 1.21 KB
/
index.js
File metadata and controls
79 lines (59 loc) · 1.21 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
const debug = require('debug')('LinkedListCycle');
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;
}
debug(headNode);
const checkCycle = (head) => {
let cycle = false;
if (head && head.next && head.next.next) {
let slow = head.next;
let fast = head.next ? head.next.next : null;
while (slow && fast) {
if (slow === fast) {
cycle = true;
break;
}
slow = slow.next;
fast = fast.next ? fast.next.next : null;
}
}
return cycle;
};
const c = checkCycle(headNode);
debug(c);
const cycle2 = (head) => {
const nodes = [];
let cur = head;
let cycle = false;
while (cur) {
if (nodes.includes(cur)) {
cycle = true;
break;
}
nodes.push(cur);
cur = cur.next;
}
return cycle;
};
const cc = cycle2(headNode);
debug(cc);