leetcode之linked List cycle && linked List cycle II

题目：

linked list cycle：

Given a linked list, determine if it has a cycle in it.

Follow up:
Can you solve it without using extra space?

linked list cycle II：

Given a linked list, return the node where the cycle begins. If there is no cycle, return null.

解答：

主要的思想就是利用一个快指针，一个慢指针，判断入口利用的就是数学知识可以得到从起始点到入口的距离和第一次相聚点到入口点的距离相等（想不懂的画下图就懂了，同时需要利用路程的2倍的关系），这样一来代码就如下了

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