Problem: 141. 环形链表
思路 & 解题方法
哈希
复杂度
时间复杂度:
添加时间复杂度, 示例: O ( n ) O(n) O(n)
空间复杂度:
添加空间复杂度, 示例: O ( n ) O(n) O(n)
Code
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def hasCycle(self, head: Optional[ListNode]) -> bool:
d = collections.defaultdict(int)
cnt = 0
while head:
if head in d:
return True
else:
d[head] = cnt
head = head.next
cnt += 1
return False