Description
Given head, the head of a linked list, determine if the linked list has a cycle in it.
There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos is used to denote the index of the node that tail’s next pointer is connected to. Note that pos is not passed as a parameter.
Return true if there is a cycle in the linked list. Otherwise, return false.
Constraints:
• The number of the nodes in the list is in the range [0, 10
4
^4
4].
• -10
5
^5
5 <= Node.val <= 10
5
^5
5
• pos is -1 or a valid index in the linked-list.
Example
Example 1:
Input: head = [3,2,0,-4], pos = 1
Output: true
Explanation: There is a cycle in the linked list, where the tail connects to the 1st node (0-indexed).
Example 2:
Input: head = [1,2], pos = 0
Output: true
Explanation: There is a cycle in the linked list, where the tail connects to the 0th node.
Example 3:
Input: head = [1], pos = -1
Output: false
Explanation: There is no cycle in the linked list.
Submissions
解题思路采用快慢指针法,定义一个slow指针和一个fast指针,slow指针步长定义为1,fast指针步长定义为2,进行循环遍历。fast指针走得快,因此如果有环,则slow和fast一定会在某点相遇。如果没有环,则fast会为空,或者fast.next会为空。
实现代码如下:
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def hasCycle(self, head: ListNode) -> bool:
if not head or head.next == None:
return False
slow = fast = head
while fast and fast.next:
slow = slow.next
fast = fast.next.next
if slow == fast:
return True
return False