快慢指针

题目来自Leetcode

141. 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?

class Solution {
public:
    boolhasCycle(ListNode *head) {
       ListNode* slow = head;
              ListNode*fast = head;
              while(fast && fast->next){
                     fast= fast->next->next;
                     slow= slow->next;
                     if(slow == fast)
                            returntrue;
              }
              return false;
    }
};

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?

使用快慢指针，它们总会在环的某个位置遇到，但是这个位置不一定恰好是结

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