141. 环形链表

最新推荐文章于 2022-08-27 21:00:33 发布

annaya

最新推荐文章于 2022-08-27 21:00:33 发布

阅读量105

点赞数

分类专栏： leetcode 文章标签：链表

本文链接：https://blog.csdn.net/annaya/article/details/106845901

版权

leetcode 专栏收录该内容

26 篇文章 0 订阅

订阅专栏

set

有重复的都可考虑set dict.key

class Solution:
    def hasCycle(self, head: ListNode) -> bool:
        s = set()
        while head:
            if head in s:
                return True
            s.add(head)
            head = head.next
        return False

快慢指针

class Solution:
    def hasCycle(self, head: ListNode) -> bool:
        slow = fast = head
        while fast and fast.next:  # 防止head为空和出现空指针的next的情况
            slow = slow.next
            fast = fast.next.next
            if slow is fast:
                return True
        return False