Given a linked list, return the node where the cycle begins. If there is no cycle, return null
.
Note: Do not modify the linked list.
Follow up:
Can you solve it without using extra space?
/**
* Definition for singly-linked list.
* class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public ListNode detectCycle(ListNode head) {
if (head == null || head.next == null) {
return null;
}
ListNode runner = head, walker = head;
boolean flag = false;
while (runner != null && runner.next != null) {
runner = runner.next.next;
walker = walker.next;
if (runner == walker) {
flag = true;
break;
}
}
if (!flag) {
return null;
} else {
runner = head;
while (runner != walker) {
runner = runner.next;
walker = walker.next;
}
return runner;
}
}
}