[LinkedList]141. Linked List Cycle

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 thenextpointer. Internally, posis used to denote the index of the node that tail'snextpointer is connected to.Note thatposis not passed as a parameter.

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

public class Solution {

    public boolean hasCycle(ListNode head) {

        if(head == null) return false;

        ListNode slow = head;

        ListNode fast = head.next;

        while (slow != fast){

            if(fast == null || fast.next == null) return false;

            slow = slow.next;

            fast = fast.next.next;

        }

        return true;

    }

}

©著作权归作者所有,转载或内容合作请联系作者
平台声明:文章内容(如有图片或视频亦包括在内)由作者上传并发布,文章内容仅代表作者本人观点,简书系信息发布平台,仅提供信息存储服务。

推荐阅读更多精彩内容