每天一道LeetCode——环形链表||

最新推荐文章于 2024-07-11 14:41:34 发布

热爱编程的小刘

最新推荐文章于 2024-07-11 14:41:34 发布

阅读量49

点赞数

分类专栏： LeetCode 文章标签：链表数据结构 c语言 leetcode

本文链接：https://blog.csdn.net/m0_74088266/article/details/130660768

版权

LeetCode 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

题目链接——环形链表||

 //方法一:
struct ListNode *detectCycle(struct ListNode *head) 
{
    struct ListNode *slow = head;
    struct ListNode *fast = head;
    while(fast && fast->next)
    {
        slow = slow->next;
        fast = fast->next->next;
        if(slow == fast)
        {
            struct ListNode *meet = fast;
            while(head != meet)
            {
                head = head->next;
                meet = meet->next;
            }
            return meet;
        }
    }
    return NULL;
}
#include <math.h>
 //方法二：
 struct ListNode* getIntersectionNode(struct ListNode* meetNew,struct ListNode* head)
 {
     struct ListNode* Nmeetnew = meetNew;
     struct ListNode* Nhead = head;
     int count1 = 1;
     int count2 = 1;
     while(Nmeetnew->next)
     {
         Nmeetnew = Nmeetnew->next;
         count1++;
     }
     while(Nhead->next)
     {
         Nhead = Nhead->next;
         count2++;
     }
     int gap = abs(count1-count2);
     struct ListNode* longlist = meetNew;
     struct ListNode* shortlist = head;
     if(count1 < count2)
     {
         longlist = head;
         shortlist = meetNew;
     }
     while(gap--)
     {
         longlist = longlist->next;
     }
     while(longlist != shortlist)
     {
         longlist = longlist->next;
         shortlist = shortlist->next;
     }
     return longlist;
 }
struct ListNode *detectCycle(struct ListNode *head) 
{
    struct ListNode *slow = head;
    struct ListNode *fast = head;
    while(fast && fast->next)
    {
        slow = slow->next;
        fast = fast->next->next;
        if(slow == fast)
        {
            struct ListNode *meetNew = fast->next;
            fast->next = NULL;
            return getIntersectionNode(meetNew,head);
            
        }
    }
    return NULL;
}