LeetCode 142环形链表2(java)

public class Solution {
    public ListNode detectCycle(ListNode head) {
        if(null == head) 
            return null;
         ListNode fast = head, slow = head;
        while (true) {
            if (fast == null || fast.next == null) return null;
            fast = fast.next.next;
            slow = slow.next;
            if (fast == slow) break;
        }
        fast = head;
        while (slow != fast) {
            slow = slow.next;
            fast = fast.next;
        }
        return fast;
    }
}