方法一:快慢指针
class Solution(object):
def hasCycle(self, head):
"""
:type head: ListNode
:rtype: bool
"""
slow=fast=head
while slow and fast and fast.next:
slow = slow.next
fast = fast.next.next
if slow is fast:
return True
return False
方法二 哈希表
可以对节点做个标记,如果节点多次被访问,那肯定是有环的
在遍历链表时,先判断节点是否再set中,若在,说明有有环。若没有,将该节点的放入set中。整个链表遍历完,则说明没有环
class Solution(object):
def hasCycle(self, head):
"""
:type head: ListNode
:rtype: bool
"""
s = set()
p = head
while p:
if p in s:
return True
s.add(p)
p=p.next
return False