/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode *detectCycle(struct ListNode *head) {
if(!head) return NULL;
struct ListNode* slow=head,*fast=head;
while(fast&&fast->next){
slow=slow->next;
fast=fast->next->next;
if(slow==fast){
struct ListNode* temp=head;
while(temp!=slow){
temp=temp->next;
slow=slow->next;
}
return slow;
}
}
return NULL;
}
标签:II,head,slow,142,struct,fast,next,链表,ListNode From: https://www.cnblogs.com/llllmz/p/18083170