141. 环形链表

141. 环形链表

题目描述

public class Solution
{
    public bool hasCycle(ListNode head)
    {
        if (head == null || head.next == 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;
    }
}

来源：CSDN

作者：qq_45100348

链接：https://blog.csdn.net/qq_45100348/article/details/104903574