[leetcode] 141& 142 Linked List Cycle I& II

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

Follow up:

Can you solve it without using extra space?

这也算是一道经典的题目了，快慢指针的思想，一个指针每次走一步，另一个每次走两步，倘若两个指针能够再次相遇，则说明链存在环

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    bool hasCycle(ListNode *head) {
        ListNode *one= head;
        ListNode *two= head;
        if(head== NULL|| head->next== NULL)  return false;
        while(two){
            one= one->next;
            two= two->next;
            if(two) two= two->next;
            if(two&& two== one) return true;
        }
        return false;
        
    }
};

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

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

II稍微增加了稍许难度，要求找出环的起始点，我们只要动手画图即可发现其中的奥秒

（无视丑陋的随手画）假设两个指针的速度分别为1和2，则第一次相遇时 2*（a+ b）= a+ b + c+ b，即 2* a= c；

所以，当存在环确定之后，分别用速度为1和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== NULL|| head->next== NULL)  return NULL;
        ListNode *one= head->next;
        ListNode *two= head->next->next;
        while(two&& one!= two){
            one= one->next;
            two= two->next;
            if(two) two= two->next;
        }
        if(!two) return NULL;
        while(head!= one){
            head= head->next;
            one= one->next;
        }
        return head;
    }
};