返回开始入环的结点

LeetCode练习,返回单链表的开始入环的结点,若无环返回NULL

//返回入环结点,无环返回NULL
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode *detectCycle(struct ListNode *head) {
     if(head==NULL||head->next==NULL)
         return NULL;
    struct ListNode* slow=head;
    struct ListNode* fast=head;
    //先让快慢指针走到相遇的结点
    while(fast&&fast->next){
        slow=slow->next;
        fast=fast->next->next;
        if(slow==fast){
            break;
        }
    }
    //慢指针返回头结点
    slow=head;
    //之后快慢指针统一每次走一步,若再次相遇即为开始入环的结点
    while(slow!=fast){
        if(fast==NULL)
        return NULL;
        slow=slow->next;
        fast=fast->next;
    }
    return slow;
}