LeetCode-142 链表环

链表环

/**
 * 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;
        ListNode* fast=head;
        ListNode* jiaodian=NULL;
        while(fast&&fast->next)
        {
            fast=fast->next->next;
            slow=slow->next;
            if(fast==slow)
            {
                jiaodian=fast;
                break;                
            }            
        }
        ListNode* congxi=head;
        if(jiaodian)
        {
            while(1)
            {
                //如果第一个就重叠了的话,这里先判断一下是否是head节点相遇的
                if(congxi==jiaodian)
                    return congxi;
                congxi=congxi->next;
                jiaodian=jiaodian->next;                              
            }           
        }
        else
            return NULL;       
    }
};