LeetCode 142. Linked List Cycle II(java)

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

Note: Do not modify the linked list.

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

解法：快慢指针，每次慢指针走一步，快指针走两步，当两个指针相遇以后，一个指针从head开始，一个指针从相遇点开始，两个新指针同时走，直到相遇，返回这个点即可。

代码：

/**
 * 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.next != slow) {
        //这个语句用来判断无环的情况，如果无环，则返回null。
            if (fast.next == null || fast.next.next == null) return null;
            slow = slow.next;
            fast = fast.next.next;
        }
        slow = slow.next;
        ListNode cur = head;
        while (cur != slow) {
            cur = cur.next;
            slow = slow.next;
        }
        return slow;
    }
}