linked-list-cycle-ii

最新推荐文章于 2021-04-07 21:12:48 发布

美不胜收:-)

最新推荐文章于 2021-04-07 21:12:48 发布

阅读量140

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/Arcpii/article/details/84867203

版权

LeetCode 专栏收录该内容

27 篇文章 0 订阅

订阅专栏

思路：

这个说的挺好的链接

代码：

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