找到环形链表的第一个节点

最新推荐文章于 2022-04-14 12:29:37 发布

踩着七彩祥云的猴子

最新推荐文章于 2022-04-14 12:29:37 发布

阅读量276

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/weixin_36149892/article/details/108989582

版权

leetcode 专栏收录该内容

148 篇文章 0 订阅

订阅专栏

class Solution {
public:
    ListNode *detectCycle(ListNode *head) {
        ListNode* fast = head;
        ListNode* slow = head;
        while (slow && fast && fast->next) {
            fast = fast->next->next;
            slow = slow->next;
            if (slow == fast) {
                ListNode* cur = head;
                while (cur && slow) {
                    // 这里一定要注意顺序, 先判断是不是相等,再往后移动,因为这个链表环的第一个节点就是入口点
                    if (cur == slow) {
                        return cur;
                    }
                    cur = cur->next;
                    slow = slow->next;
                    
                }
            }
        }
        return nullptr;
    }
};

code2- 直接while判断

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