用两个快慢指针均从列表头部开始,慢指针每次前进一步,快指针每次前进两步,如果成环,则它们会相遇。
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def hasCycle(self, head):
"""
:type head: ListNode
:rtype: bool
"""
if not head:
return False
slow = head
fast = head
while True:
slow = slow.next
if not fast.next or not fast.next.next:
return False
fast = fast.next.next
if slow == fast:
return True
拓展:Linked List Cycle Ⅱ(寻找cycle起始的位置)