Linked List Cycle II

最新推荐文章于 2022-05-19 13:04:17 发布

Shane Zhao

最新推荐文章于 2022-05-19 13:04:17 发布

阅读量81

点赞数

分类专栏： LeetCode 文章标签：链表

本文链接：https://blog.csdn.net/silence2015/article/details/91045019

版权

LeetCode 专栏收录该内容

45 篇文章 0 订阅

订阅专栏

Given a linked list, return the node where the cycle begins. If there is no cycle, return null.

To represent a cycle in the given linked list, we use an integer pos which represents the position (0-indexed) in the linked list where tail connects to. If pos is -1, then there is no cycle in the linked list.

Note: Do not modify the linked list.

Example 1:
在这里插入图片描述
Input: head = [3,2,0,-4], pos = 1
Output: tail connects to node index 1
Explanation: There is a cycle in the linked list, where tail connects to the second node.

Example 2:
在这里插入图片描述
Input: head = [1,2], pos = 0
Output: tail connects to node index 0
Explanation: There is a cycle in the linked list, where tail connects to the first node.

Example 3:
在这里插入图片描述
Input: head = [1], pos = -1
Output: no cycle
Explanation: There is no cycle in the linked list.

Follow up:
Can you solve it without using extra space?

思路：快慢指针

ListNode *detectCycle(ListNode *head) {
        if (!head||!head->next) return NULL;
        // 这儿fast和slow都要先跑出去是因为如果两个都指向head，会影响下面while循环判断
        ListNode *fast=head->next->next,*slow=head->next;
        while(fast&&fast!=slow)
        {
            
            slow=slow->next;
            if (fast->next) fast=fast->next->next;
            else return NULL;
        }
        if (!fast) return NULL;
        //cout<<fast->val<<endl;
        slow=head;
        while(slow!=fast)
        {
            slow=slow->next;
            fast=fast->next;
        }
        return slow;
    }