-
Notifications
You must be signed in to change notification settings - Fork 66
/
Copy pathLinkedListCycle.java
39 lines (33 loc) · 1.18 KB
/
LinkedListCycle.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
class ListNode {
int value = 0;
ListNode next;
ListNode(int value) {
this.value = value;
}
}
class LinkedListCycle {
public static boolean hasCycle(ListNode head) {
// TODO: Write your code here
ListNode fast = head;
ListNode slow = head;
while (fast != null && fast.next != null) {
fast = fast.next.next;
slow = slow.next;
if (fast == slow) return true;
}
return false;
}
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);
System.out.println("LinkedList has cycle: " + LinkedListCycle.hasCycle(head));
head.next.next.next.next.next.next = head.next.next;
System.out.println("LinkedList has cycle: " + LinkedListCycle.hasCycle(head));
head.next.next.next.next.next.next = head.next.next.next;
System.out.println("LinkedList has cycle: " + LinkedListCycle.hasCycle(head));
}
}