力扣142.环形链表 II

问题描述

---

分析：

找进环点 设进环前链表长度为L，环长为C。定义快慢指针，快指针速度为慢指针的2倍。若快慢指针相遇，即链表中含环。记相遇点meetNode,设距离环的起始点距离为N。慢指针走的路程为L+N,快指针走的路程为L+N+kC（k=1，2,3…）。因为快指针的速度为慢指针的2倍，所以可得快指针的路程为慢指针的2倍，即2L+2N=L+N+kC，化简得L=kC-N，即相遇后慢指针与头指针以相同的速度移动，会在环的起始点相遇。

---

解决代码：

struct ListNode
{
    int val;
    struct ListNode *next;
};
struct ListNode *findMeet(struct ListNode *head, struct ListNode *meet)
{
    while (head != meet)
    {
        meet = meet->next;
        head = head->next;
    }
    return meet;
}
struct ListNode *detectCycle(struct ListNode *head)
{
    struct ListNode *fast = head;
    struct ListNode *slow = head;
    struct ListNode *meetNode = NULL;
    while (fast && fast->next)
    {
        slow = slow->next;
        fast = fast->next->next;
        if (slow == fast)
        {
            meetNode = slow = fast;
            return findMeet(head, meetNode);
        }
    }
    return NULL;
}