Sorting linked list with mutation (oh no)
This commit is contained in:
+7
-5
@@ -187,13 +187,15 @@ def sort_linked_list(head: stdlib.ListNode | None) -> stdlib.ListNode | None:
|
||||
|
||||
cur = ret
|
||||
|
||||
for _, node in sorted(by_val):
|
||||
for _, node in sorted(by_val, key=lambda v: v[0]):
|
||||
if cur is None:
|
||||
cur = ret = stdlib.ListNode(node.val)
|
||||
cur = ret = node
|
||||
continue
|
||||
|
||||
next_node = stdlib.ListNode(node.val)
|
||||
cur.next = next_node
|
||||
cur = next_node
|
||||
cur.next = node
|
||||
cur = cur.next
|
||||
|
||||
if cur is not None:
|
||||
cur.next = None
|
||||
|
||||
return ret
|
||||
|
||||
Reference in New Issue
Block a user