-
代码:
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
-
思路一:哈希表法。就是遍历一遍链表,如果某个节点没有被遍历过,则加入我们的哈希表中,链表后移。反之,返回True,
-
结果:
04-22
301
10-29
191