The Insertion Sort List solution is below.
05 Jun 2024•Python
Insertion Sort List
Python solution for Insertion Sort List.
Solution files
Python•insertion-sort-list/solution.py
from typing import Optional
class ListNode:
def __init__(self, val: int = 0, next: "Optional[ListNode]" = None) -> None:
self.val = val
self.next = next
class Solution:
def insertionSortList(self, head: Optional[ListNode]) -> Optional[ListNode]:
if head is None:
return None
dummy = ListNode(-10**9)
current = head
while current:
next_unsorted = current.next
prev = dummy
while prev.next and prev.next.val < current.val:
prev = prev.next
current.next = prev.next
prev.next = current
current = next_unsorted
return dummy.next