mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-29 17:13:36 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix

Browse Source
This commit is contained in:
Hardik Pawar 2024-10-03 11:40:56 +05:30
parent 4aa953e400
commit 62d2412482
1 changed files with 2 additions and 2 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

@ -44,10 +44,10 @@ 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 head return head
slow = head # one node at a time slow: Node | None = head # one node at a time
fast = head # two nodes at a time fast = head # two nodes at a time
while fast.next and fast.next.next: while fast.next and fast.next.next:
slow: Node | None = slow.next slow = slow.next
fast = fast.next.next fast = fast.next.next
return slow return slow