Tags: "leetcode", "linked-list", "slow-fast-pointers", "two-pointers", access_time 1-min read

Edit this post on Github

Linked List Cycle

Created: October 21, 2018 by [lek-tin]

Last updated: October 21, 2018

Given a linked list, determine if it has a cycle in it.

Follow-up

Can you solve it without using extra space?

Solution

# 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
        """
        slow = head
        fast = head
        while fast:
            # fast reaches the end, no cycle was detected
            if fast and not fast.next:
                return False
            fast = fast.next.next
            slow = slow.next
            if fast == slow:
                return True
        return False