Sync LeetCode submission Runtime - 46 ms (55.96%), Memory - 19.7 MB (25.14%)

Author: jimit105

0141-linked-list-cycle/solution.py

@@ -1,6 +1,7 @@
-# Approach 2 - Floyd's Cycle Finding Algorithm
+# Approach 2: Floyd's Cycle Finding Algorithm (Fast and Slow Pointer)
 
-# Time: O(n), Space: O(1)
+# Time: O(n)
+# Space: O(1)
 
 # Definition for singly-linked list.
 # class ListNode:
@@ -14,11 +15,12 @@ def hasCycle(self, head: Optional[ListNode]) -> bool:
             return False
         slow = head
         fast = head.next
-        
+
         while slow != fast:
             if fast is None or fast.next is None:
                 return False
             slow = slow.next
             fast = fast.next.next
-            
+        
         return True
+