mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-27 15:01:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix

Browse Source
This commit is contained in:
Hardik Pawar 2024-10-03 11:56:04 +05:30
parent 1ac1f0c0e4
commit ed62d33870
1 changed files with 3 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
data_structures/linked_list/merge_sort_linked_list.py
View File

@ -35,10 +35,12 @@ def get_middle(head: Node | None) -> Node | None:
if head is None or head.next is None: if head is None or head.next is None:
return None return None
slow: Node = head slow: Node | None = head
fast: Node | None = head.next fast: Node | None = head.next
while fast is not None and fast.next is not None: while fast is not None and fast.next is not None:
if slow is None:
return None
slow = slow.next slow = slow.next
fast = fast.next.next fast = fast.next.next