[Leetcode]142. Linked List Cycle II

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?

设置两个指针，一个fast，每次移动2个节点，一个slow，每次移动一个节点，当fast和slow相遇时，slow肯定没有遍历完链表或者刚遍历完，而fast已经在环内转了n圈。设slow走了s步，则fast走了2s步，设环长为r，则有2s = s + nr.

设整个链表长为L，换入口点与相遇点距离为a，起点到入口点距离为x，则有x + a = nr = ( n - 1)r + r = (n - 1)r + L-x，所以x = (n - 1)r + (L - x - a)

L - x - a为相遇点到环入口点的距离，由此可知，从链表头到入口点的距离等于(n - 1)圈加上相遇点到入口点的距离，于是可以从head开始另设一个指针slow2，两个慢指针每次移动一个节点，它们肯定在入口点相遇。

/**
 * 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 *slow = head, *fast = head;
        while (fast != nullptr && fast->next != nullptr)
        {
            slow = slow->next;
            fast = fast->next->next;
            if (fast == slow)
            {
                ListNode *slow2 = head;
                while (slow2 != slow)
                {
                    slow2 = slow2->next;
                    slow = slow->next;
                }
                return slow2;
            }
        }
        return nullptr;
    }
};