Leetcode: Linked List Cycle II

最新推荐文章于 2025-11-15 17:29:42 发布

原创最新推荐文章于 2025-11-15 17:29:42 发布 · 866 阅读

0 ·

CC 4.0 BY-SA版权

Linked List 专栏收录该内容

16 篇文章

订阅专栏

本文介绍了一种高效算法，用于确定链表中循环的起始节点。通过使用快慢指针技巧，该方法能在不额外占用空间的情况下找到循环起点。

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

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

/**
 * Definition for singly-linked list.
 * class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode detectCycle(ListNode head) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        if(head == null)
            return head;
        ListNode slow = head;
        ListNode fast = head;
        while(fast != null && fast.next != null){
            slow = slow.next;
            fast = fast.next.next;
            if(slow == fast)
                break;
        }
        if(fast == null || fast.next == null)
            return null;
        slow = head;
        while(slow != fast){
            slow = slow.next;
            fast = fast.next;
        }
        return fast;
    }
}