142. 环形链表 II

要求：起始节点
思路：设环起始点距离链表开头L，环长度r，两个指针相遇时在环头前d步，则慢指针走了L+d+k1r，快指针走了L+d+k2r，则2(L+d+k1r)=L+d+k2r，化简得L+d=(k2-2k1)r，显然左右两边均是大于0的，则L=(k2-2k1)r-d，式子右边是在走了(k2-2k1-1)圈后再走r-d即从d处回到环头，式子左边是从链表头走到环头，那么解法：在快慢指针相遇后快指针每次走一步，慢指针从链表头开始走，两者首次相遇即为环头

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