Leetcode142. 环形链表 II

JehanRio

已于 2023-09-07 10:18:19 修改

阅读量165

点赞数

分类专栏： Leetcode专栏文章标签：链表 leetcode 数据结构

于 2023-06-01 13:24:47 首次发布

本文链接：https://blog.csdn.net/weixin_51322383/article/details/130986259

版权

Leetcode专栏专栏收录该内容

278 篇文章 0 订阅

订阅专栏

文章目录

题目
代码（首刷看解析）
代码（7.30 二刷自解）
代码（8.8 三刷自解）
代码（9.7 四刷自解）

题目

在这里插入图片描述
142. 环形链表 II

代码（首刷看解析）

在这里插入图片描述

class Solution {
public:
    ListNode *detectCycle(ListNode *head) {
        auto fast = head, slow = head;
        while(fast && fast->next) {
            slow = slow->next;
            fast = fast->next->next;
            if(slow == fast)
                break;
        }
        if(!fast || !fast->next)
            return nullptr;
        slow = head;
        while(slow != fast) {
            slow = slow->next;
            fast = fast->next;
        }
        return slow;
    }   
};

代码（7.30 二刷自解）

class Solution {
public:
    ListNode *detectCycle(ListNode *head) {
        auto fast = head;
        auto slow = head;
        if(!fast || !fast->next)
            return nullptr;
        do {
            if(!fast || !fast->next)
                return nullptr;
            fast = fast->next->next;
            slow = slow->next;
        }while(fast != slow);
        slow = head;
        while(slow != fast) {
            slow = slow->next;
            fast = fast->next;
        }
        return slow;
    }
};

代码（8.8 三刷自解）

class Solution {
public:
    ListNode* EntryNodeOfLoop(ListNode* pHead) {
        auto fast = pHead, slow = pHead;
        while(fast && fast->next) {
            fast = fast->next->next;
            slow = slow->next;
            if(fast == slow)
                break;
        }
        if(!fast || !fast->next)
            return nullptr;
        slow = pHead;
        while(fast != slow) {
            fast = fast->next;
            slow = slow->next;
        }
        return fast;
    }
};

func detectCycle(head *ListNode) *ListNode {
    fast, slow := head, head
    for fast != nil && fast.Next != nil {
        fast = fast.Next.Next
        slow = slow.Next
        if fast == slow {
            break
        }
    }
    if fast == nil || fast.Next == nil {
        return nil
    }
    slow = head
    for fast != slow {
        slow = slow.Next
        fast = fast.Next
    }
    return fast
}

代码（9.7 四刷自解）

class Solution {
public:
    ListNode *detectCycle(ListNode *head) {
        auto fast = head, slow = head;
        while(fast && fast->next) {
            fast = fast->next->next;
            slow = slow->next;
            if(fast == slow)
                break;
        }
        if(!fast || !fast->next)
            return nullptr;
        fast = head;
        while(fast != slow) {
            fast = fast->next;
            slow = slow->next;
        }
        return fast;
    }
};