leetcode 144 环形链表Linked List Cycle

题目：
141. Linked List Cycle
Easy
12.1K
1K
Companies
Given head, the head of a linked list, determine if the linked list has a cycle in it.

There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos is used to denote the index of the node that tail’s next pointer is connected to. Note that pos is not passed as a parameter.

Return true if there is a cycle in the linked list. Otherwise, return false.

Example 1:

Input: head = [3,2,0,-4], pos = 1
Output: true
Explanation: There is a cycle in the linked list, where the tail connects to the 1st node (0-indexed).

+快慢指针！！
一个每次跳二个，
一个每次跳一个

var hasCycle = function(head) {
    let fast=head;
    while(fast!==null && fast.next!==null){
        fast=fast.next.next;
        head=head.next;
        if(fast==head){
            return true;
        }
       
    }
    return false;
};