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?

思路：快慢指针

/**
 * Definition for singly-linked list.
 * class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    boolean flag = false;
    public boolean hasCycle(ListNode head) {
        if(head == null || head.next == null){
            return flag;
        }
        //快慢指针
       ListNode fast = head;
       ListNode slow = head;
       while(fast != null && fast.next != null){
           fast = fast.next.next;
           slow =slow.next;
           if(slow == fast){
               flag =true;
               break;
           }
       }
        return flag;
    }
}