Difficulty: Medium
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.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *detectCycle(ListNode *head) {
ListNode *fast=head;
ListNode *slow=head;
while(fast){
fast=fast->next;
if(!fast)
return nullptr;
fast=fast->next;
slow=slow->next;
if(fast==slow){
slow=head;
while(fast!=slow){
fast=fast->next;
slow=slow->next;
}
return slow;
}
}
return nullptr;
}
};