mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-17 14:58:10 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix

Browse Source
This commit is contained in:
Hardik Pawar 2024-10-03 11:43:51 +05:30
parent 62d2412482
commit d2b3c1d11a
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
data_structures/linked_list/merge_sort_linked_list.py
View File

@ -44,11 +44,12 @@ def get_middle(head: Node | None) -> Node | None:
if head is None or head.next is None:
return head
slow: Node | None = head # one node at a time
fast = head # two nodes at a time
while fast.next and fast.next.next:
slow: Node | None = head
fast: Node | None = head
while fast is not None and fast.next is not None:
slow = slow.next
fast = fast.next.next
return slow