Given a linked list, return the node where the cycle begins. If there is no cycle, return null
.
Follow up:
Can you solve it without using extra space?
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *detectCycle(ListNode *head) {
if(head == NULL || head->next == NULL) return NULL;
ListNode *slow = head;
ListNode *fast = head;
while(slow != NULL && fast != NULL) {
slow = slow->next;
fast = fast->next;
if(fast != NULL) {
fast = fast->next;
}
else {
return NULL;
}
if(slow == fast) {
break;
}
}
if(slow == NULL || fast == NULL)
return NULL;
fast = head;
while(slow != fast) {
slow = slow->next;
fast = fast->next;
}
return slow;
}
};