LeetCode 142. 环形链表 II

题目描述

142. 环形链表 II

解法：弗洛伊德的龟和兔子

我们重点关注最后一个等式 $a=c+(n-1)(b+c)$，也就是如果我们有一个指针从起始点开始跑，跑过 $a$ 的路程到达环入口，等于另外一个指针从相遇点开始跑，跑过 $c$ 的路程达到环入口，这就是核心思想

C++ 实现

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *getintersect(ListNode * head)
    {
        ListNode *tortoise = head;
        ListNode *hare = head;
        while(hare!=NULL && hare->next!=NULL)
        {
            tortoise = tortoise->next;
            hare = hare->next->next;
            if(tortoise==hare) return tortoise;
        }
        return NULL;
    }
    ListNode *detectCycle(ListNode *head) {
        if(head==NULL) return NULL;
        ListNode *intersect = getintersect(head);
        if(intersect==NULL) return NULL;
        ListNode *ptr1 = head;
        ListNode *ptr2 = intersect;
        while(ptr1!=ptr2)
        {
            ptr1 = ptr1->next;
            ptr2 = ptr2->next;
        }
        return ptr1;
    }
};

Python 实现

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:

    def getIntersect(self, head):
        if not head: return None
        slow = head
        fast = head
        while fast and fast.next:
            slow = slow.next
            fast = fast.next.next
            if slow==fast: return slow
        return None

    def detectCycle(self, head: ListNode) -> ListNode:
        if not head: return None
        ptr1 = head
        ptr2 = self.getIntersect(head)
        if not ptr2: return None 
        while ptr1!=ptr2:
            ptr1 = ptr1.next
            ptr2 = ptr2.next
        return ptr1