Classical Python solution

  • 0
    # Definition for singly-linked list.
    # class ListNode:
    #     def __init__(self, x):
    #         self.val = x
    # = None
    class Solution:
        # @param head, a ListNode
        # @return a boolean
        def hasCycle(self, head):
            if not head:
                return False
            slow = fast = head
            while fast and
                slow =
                fast =
                if slow is fast:
                    return True
            return False

  • 0

    Nice solution, while the first two checking lines are not necessary.

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.