如果链表中有某个节点,可以通过连续跟踪 next 指针再次到达,则链表中存在环。 为了表示给定链表中的环,评测系统内部使用整数 pos 来表示链表尾连接到链表中的位置(索引从 0 开始)。如果 pos 是 -1,则在该链表中没有环。注意:pos 不作为参数进行传递,仅仅是为了标识链表的实际情况。
不允许修改 链表。
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/linked-list-cycle-ii
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
hash 判断节点是否访问过
def detectCycle(self, head: ListNode):
if head is None:
return None
cursor = head
dic = {}
dic[cursor] = 1
redundant = None
while cursor.next is not None:
cursor = cursor.next
if dic.get(cursor) is not None:
redundant = cursor
break
else:
dic[cursor] = 1
return redundant
快慢指针
需要证明慢指针在入环第一圈还没结束时就可以与快指针相遇
def detectCycle2(self, head: ListNode):
if head is None:
return None
slow = head
fast = head
has_circle = False
while slow.next is not None and fast.next is not None and fast.next.next is not None:
slow = slow.next
fast = fast.next.next
if slow == fast:
has_circle = True
break
if not has_circle:
return None
cursor = head
while cursor != slow:
cursor = cursor.next
slow = slow.next
return cursor