[leet code] Linked List Cycle II

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?

Extension from problem Linked List Cycle.  Basic idea of this problem is to find out the meeting point first (solved in Linked List Cycle problem) firstly, then utilizing the distances both pointers have already moved up to this point to determine the start point of the cycle.  Detail description can be found in blog [算法][LeetCode]Linked List Cycle & 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 || head.next == null) return null;
        
        ListNode slow = head;
        ListNode fast = head;

        // find out the meeting point
        while (fast != null && fast.next != null){
            fast = fast.next.next;
            slow = slow.next;
            if(fast == slow) break;
        }
        
        if (fast == null || fast.next == null) return null;
        
        // (circle must exist) find out the start point
        ListNode start1 = head;
        ListNode start2 = fast;
        
        while (start1 != start2){
            start1 = start1.next;
            start2 = start2.next;
        }
        return start1;
    }
}