https://leetcode.cn/problems/linked-list-cycle-ii/description/
思路
快慢指针确定是否有环,fast移动两步,slow移动一步,如果有环会相等;
有环后,确定环的入口。将fast指定为index1,head为index2,同时加一。相等时为环入口。
code
/**
* 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,*slow=head;
while(fast!=NULL&&fast->next){
fast=fast->next->next;
slow=slow->next;
if(fast==slow){
ListNode* index1=fast;
ListNode* index2=head;
while(index1!=index2){
index1=index1->next;
index2=index2->next;
}
return index2;
}
}
return NULL;
}
};