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

Linked List Cycle II.java

/**
 * 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;
        
        try {
            do {
                fast = fast.next;
                fast = fast.next;
                slow = slow.next;
            } while(fast!=null && fast!=slow);
            
        } catch(Exception e){}
        
        if(slow==null || fast==null || slow!=fast)
            return null;
            
        slow = head;
        
        while(slow!=fast) {
            slow = slow.next;
            fast = fast.next;
        }
        return slow;
    }
}