-
Notifications
You must be signed in to change notification settings - Fork 66
/
Copy pathLinkedListCycleStart.java
62 lines (53 loc) · 1.77 KB
/
LinkedListCycleStart.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
class ListNode {
int value = 0;
ListNode next;
ListNode(int value) {
this.value = value;
}
}
class LinkedListCycleStart {
public static ListNode findCycleStart(ListNode head) {
// TODO: Write your code here
ListNode fast = head, slow = head;
boolean flag = false;
while (fast != null && fast.next != null) {
fast = fast.next.next;
slow = slow.next;
if (fast == slow) {
flag = true;
break;
}
}
if (!flag) return null;
int length = 0;
do {
fast = fast.next.next;
slow = slow.next;
length++;
} while (fast != slow);
fast = head;
slow = head;
for (int i = 0; i < length; i++) {
slow = slow.next;
}
while (fast != slow) {
fast = fast.next;
slow = slow.next;
}
return fast;
}
public static void main(String[] args) {
ListNode head = new ListNode(1);
head.next = new ListNode(2);
head.next.next = new ListNode(3);
head.next.next.next = new ListNode(4);
head.next.next.next.next = new ListNode(5);
head.next.next.next.next.next = new ListNode(6);
head.next.next.next.next.next.next = head.next.next;
System.out.println("LinkedList cycle start: " + LinkedListCycleStart.findCycleStart(head).value);
head.next.next.next.next.next.next = head.next.next.next;
System.out.println("LinkedList cycle start: " + LinkedListCycleStart.findCycleStart(head).value);
head.next.next.next.next.next.next = head;
System.out.println("LinkedList cycle start: " + LinkedListCycleStart.findCycleStart(head).value);
}
}