Update tortoise_and_hare.md

toluwalase104 · adamant-pwn · commit c5ccd48dd906 · 2024-01-04T14:35:39.000+01:00
I removed slow !=null from the while loop in hasCycle() because the fast pointer will always be ahead of the slow pointer, so it will reach the end of the linked list first (if it doesn't contain a cycle)

In the case that, they both start at a null node, the fast pointer will be able to detect this by itself

A minor change.
diff --git a/src/others/tortoise_and_hare.md b/src/others/tortoise_and_hare.md
@@ -41,7 +41,7 @@ public boolean hasCycle(ListNode head) {
     ListNode slow = head;
     ListNode fast = head;
 
-    while(slow !=null && fast != null && fast.next != null){
+    while(fast != null && fast.next != null){
         slow = slow.next;
         fast = fast.next.next;
         if(slow==fast){
