【多解LeetCode】 142.环形链表 II

顾冷__

已于 2022-03-31 21:38:11 修改

阅读量145

点赞数 6

分类专栏：多解LeetCode 文章标签：链表 leetcode 算法

于 2022-01-13 22:53:47 首次发布

本文链接：https://blog.csdn.net/guleng______/article/details/122484619

版权

多解LeetCode 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

142.环形链表 II

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */

struct ListNode * judgecircle(struct ListNode *head) 
{
    if(head == NULL)    return 0;
    struct ListNode * fast ,* slow ;
    fast = slow = head;
    while(fast && fast -> next)
    {
        fast = fast -> next -> next ;
        slow = slow -> next ;
        if(fast == slow )    return slow;
    }
    return NULL;
}

struct ListNode *detectCycle(struct ListNode *head) 
{
    struct ListNode * meet = judgecircle(head);//(1)
    struct ListNode * cur = head;
    if(meet)//如果存在环
    {
        while(cur)//(2)
        {
            if(meet == cur)     return meet;//找到就返回地址
            meet = meet -> next;
            cur = cur -> next; 
        }
    }
    else    return NULL;//找不到返回NULL
    return ;
}