LeetCode 142. Linked List Cycle II（快慢指针）

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.

题意

给定一个链表，求链表的环的首节点，如果链表无环，则返回null

思路

参考LeetCode 141. Linked List Cycle（快慢指针）的思路，采用快慢指针。当快指针和慢指针相遇后，将慢指针移到链表首端，快指针和慢指针同步以一次走一步的速度前进，当慢指针和快指针再次相遇，则相遇处就是环的首节点
证明：
假设链表头到链表环的首节点的长度为S, 环的长度为C，从环的首节点到快指针和慢指针第一次相遇的节点的长度为P.
快指针和慢指针第一次相遇满足方程式：
S + kC + P = 2(S + P)
得
S = kC - P
其中k是一个正整数，表示慢指针和快指针相遇的时候快指针比慢指针多走了k圈。
慢指针和快指针以同样的速度第二次相遇前，慢指针和快指针分别走了S步和(kC - P)步，S = kC - P，两者在环的首节点相遇。

代码

/*
 * @lc app=leetcode id=142 lang=java
 *
 * [142] Linked List Cycle II
 */
/**
 * 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) {
        if (head == null) {
            return null;
        }
        ListNode slow = head, fast = head;
        while (fast != null) {
            slow = slow.next;
            fast = fast.next;
            if (fast != null) {
                fast = fast.next;
            } else {
                return null;
            }            
            if (slow == fast) {
                break;
            }
        }
        if (fast == null) {
            return null;
        }
        slow = head;
        while (slow != fast) {
            slow = slow.next;
            fast = fast.next;
        }
        return slow;
    }
}