LeetCode - 141. Linked List Cycle

Description

Given a linked list, determine if it has a cycle in it.

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

Code

/**
 * Definition for singly-linked list.
 * class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public boolean hasCycle(ListNode head) {
        if(head == null || head.next == null ) {
            return false;
        }
        ListNode fast = head,slow = head;
        // 慢指针走一步，快指针走三步
        // 如果有环，快慢指针就一定会相遇，快指针也可以走两步，只是相遇的早晚有差别
        while(head.next != null && head.next.next != null && head.next.next.next != null){
            fast = fast.next;
            slow = slow.next.next.next;
            if(fast == slow) {
                return true;
            }  
            head = head.next.next.next;
        }
        // 如果不改变头指针，可以用slow进行判断
        // 慢指针走一步，快指针走两步
        // while(slow.next != null && slow.next.next != null){
        //     fast = fast.next;
        //     slow = slow.next.next;
        //     if(fast == slow) {
        //         return true;
        //     }        
        // }
        return false;
    }
}