Given a linked list, determine if it has a cycle in it.
To represent a cycle in the given linked list, we use an integer
pos
which represents the position (0-indexed) in the linked list where tail connects to. Ifpos
is-1
, then there is no cycle in the linked list.
Example 1:
Input: head = [3,2,0,-4], pos = 1 Output: true Explanation: There is a cycle in the linked list, where tail connects to the second node.Example 2:
Input: head = [1,2], pos = 0 Output: true Explanation: There is a cycle in the linked list, where tail connects to the first node.Example 3:
Input: head = [1], pos = -1 Output: false Explanation: There is no cycle in the linked list.
Follow up:
Can you solve it using O(1) (i.e. constant) memory?
借助额外空间
#创建一个空集合必须用 set() 而不是 { },因为 { } 是用来创建一个空字典。
node_set = set()
while head:
if id(head) in node_set: return True
else: node_set.add(id(head))
head = head.next
return False
快慢指针
def hasCycle(self, head):
"""
:type head: ListNode
:rtype: bool
"""
slower = faster = head
while faster and faster.next:
slower = slower.next
faster = faster.next.next
if slower == faster: return True
return False