LinkedList-141-Linked List Cycle

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

Solution:

//定义两个指针，一个为slow,每次走一步,一个为fast,每次走两步,若slow与fast相等，则必有环
public class Solution {
    public boolean hasCycle(ListNode head) {
        ListNode slow = head, fast = head;
        while (fast != null && fast.next != null){
            slow = slow.next;
            fast = fast.next.next;

            if (slow == fast) return true;
        }

        return false;

    }
}