Leetcode: Linked List Cycle II

logic_nut

于 2014-01-29 00:39:51 发布

阅读量883

点赞数

分类专栏：面试题

本文链接：https://blog.csdn.net/logic_nut/article/details/18852585

版权

面试题专栏收录该内容

50 篇文章

订阅专栏

本文提供了一种解决LeetCode上链表环II问题的方法。通过定义快慢指针找到环的入口节点，首先确定环的存在，然后计算环的长度，并最终定位到环的起始位置。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

http://oj.leetcode.com/problems/linked-list-cycle-ii/

参考了http://blog.csdn.net/whuwangyi/article/details/14103993

/**
 * 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) return NULL;
        ListNode* fastHead=head;
        ListNode* slowHead=head;
        // get the first meeting point
        while(true){
            slowHead=slowHead->next;
            fastHead=fastHead->next;
            if(fastHead==NULL) return NULL;
            fastHead=fastHead->next;
            if(fastHead==NULL) return NULL;
            if(fastHead==slowHead) break;
        }
        // get the length of the cycle
        int cnt=1;
        slowHead=slowHead->next;
        while(slowHead!=fastHead){
            slowHead=slowHead->next;
            cnt++;
        }
        // start from the head and make the fastHead ahead of slowHead by cnt nodes
        fastHead=slowHead=head;
        while(cnt!=0){
            fastHead=fastHead->next;
            cnt--;
        }
        while(fastHead!=slowHead){
            fastHead=fastHead->next;
            slowHead=slowHead->next;
        }
        return fastHead;
    }
};