Given the
head
of a linked list, return the list after sorting it in ascending order.
class ListNode:
def __init__(self, val=0, next=None):
self.val = val
self.next = next
class Solution:
def sortList(self, head):
# Brute Force
node = head
temp = []
while node:
temp.append(node.val)
node = node.next
temp.sort()
dummy_node = ListNode(0)
node = dummy_node
for n in temp:
node.next = ListNode(n)
node = node.next
return dummy_node.next