[算法笔记]-环形链表Ⅱ-解题方法

最新推荐文章于 2024-09-12 19:02:20 发布

Corsair_cxs

最新推荐文章于 2024-09-12 19:02:20 发布

阅读量141

点赞数 1

分类专栏：数据结构笔记 C++ 文章标签：算法链表 leetcode

本文链接：https://blog.csdn.net/cxs5534/article/details/107903560

版权

C++ 同时被 2 个专栏收录

17 篇文章 2 订阅

订阅专栏

数据结构笔记

9 篇文章 1 订阅

订阅专栏

原题链接：https://leetcode-cn.com/problems/linked-list-cycle-ii/

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?

引用官方题解的配图：

在这里插入图片描述

解法思路：

1. 快慢指针

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *detectCycle(ListNode *head) {
        if(!head)
            return NULL;
        ListNode *fast = head, *slow = head;
        bool has_cycle = false;
        while(fast && fast->next)
        {
            fast = fast->next->next;
            slow = slow->next;
            if(fast == slow)
            {
                has_cycle = true;
                break;
            }
        }
        if(has_cycle)
        {
            ListNode *cycle_start = head;
            while(cycle_start!=slow)
            {
                cycle_start = cycle_start->next;
                slow = slow->next;
            }
            return cycle_start;
        }
        else
        {
            return NULL;
        }
    }
};

2. 哈希表

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *detectCycle(ListNode *head) {
        unordered_map <ListNode *, int> m;
        ListNode *p = head;
        while(p)
        {
            if(m[p])    return p;
            m[p]++;
            p = p->next;
        }       
        return NULL;
    }
};