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

Fix

Browse Source
This commit is contained in:
Hardik Pawar 2024-10-03 11:45:03 +05:30
parent d2b3c1d11a
commit fb13521086
1 changed files with 2 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
data_structures/linked_list/merge_sort_linked_list.py
View File

@ -47,6 +47,8 @@ def get_middle(head: Node | None) -> Node | None:
slow: Node | None = head slow: Node | None = head
fast: Node | None = head fast: Node | None = head
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: # This should never happen, but it satisfies the type checker
return None
slow = slow.next slow = slow.next
fast = fast.next.next fast = fast.next.next