-
Notifications
You must be signed in to change notification settings - Fork 0
/
LengthOfLoopLinkedList.java
81 lines (68 loc) · 1.8 KB
/
LengthOfLoopLinkedList.java
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
/****************************************************************
Following is the class structure of the Node class:
class Node {
public int data;
public Node next;
Node()
{
this.data = 0;
this.next = null;
}
Node(int data)
{
this.data = data;
this.next = null;
}
Node(int data, Node next)
{
this.data = data;
this.next = next;
}
};
*****************************************************************/
import java.util.*;
public class Solution
{
static Node findEntry(Node head) {
if (head != null){
Node fast = head;
Node slow = head;
boolean hasCycle = false;
while (fast.next != null && fast.next.next != null) {
fast = fast.next.next;
slow = slow.next;
if (fast == slow) {
hasCycle = true;
break;
}
}
if (hasCycle) {
slow = head;
while (slow!=fast) {
slow = slow.next;
fast = fast.next;
}
return slow;
}
}
return null;
}
public static int lengthOfLoop(Node head) {
// Write your code here
/**
* Find entry point of the loop and count
*/
Node entry = findEntry(head);
if (entry != null) {
int len = 0;
Set<Node> set = new HashSet<>();
Node cursor = entry;
while(set.add(cursor)) {
cursor = cursor.next;
len++;
}
return len;
}
return 0;
}
}