LeetCode 142 环形链表II

最新推荐文章于 2024-02-04 15:45:00 发布

JevahCode

最新推荐文章于 2024-02-04 15:45:00 发布

阅读量66

点赞数

本文链接：https://blog.csdn.net/weixin_43907886/article/details/108997819

版权

题目描述
在这里插入图片描述
思路整理

在这里插入图片描述
代码

/**
 * 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 *flow, *fast;
       flow = head;
       fast = head;

       while(1)
       {
           if(fast == NULL)
                return fast;
            if(fast->next == NULL)
                return NULL;
           fast = fast->next->next;
           flow = flow->next;
           if(flow == fast)
             break;
       }
       fast = head;
       while(flow != fast)
       {
           flow = flow->next;
           fast = fast->next;
       }
       return flow;
    }
};