【LeetCode】-Linked List Cycle

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

Follow up:

Can you solve it without using extra space?

/**
 * 解题思路：
 * 1.定义快慢指针，指向头节点；
 * 2.慢指针每次走1步，快指针每次走2步，二者能够相遇，说明存在环。
 * 
 * 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)
			return false;
		ListNode slow = head;
		ListNode fast = head.next;
		while( fast!=null && fast.next!=null ){
			slow = slow.next;
			fast = fast.next.next;
			if( slow==fast ){
				return true;
			}
		}
		return false;    
    }
}