时间复杂度(O(n)),思想:快慢指针
# 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):
p, q = head, head
while q is not None and q.next is not None:
p, q = p.next, q.next.next
if p is q: return True
return False