当前位置：网站首页>LinkedList 5-141. 环形链表

LinkedList 5-141. 环形链表

2022-06-23 11:39:00 【人工智能曾小健】 

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

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

原网站

版权声明
本文为[人工智能曾小健]所创，转载请带上原文链接，感谢
https://blog.csdn.net/sinat_37574187/article/details/125418636

边栏推荐

猜你喜欢

随机推荐