[leetCode] 148. Sort List (Python)

Given the head of a linked list, return the list after sorting it in ascending order.

Follow up: Can you sort the linked list in O(n logn) time and O(1) memory (i.e. constant space)?

 

Example 1:

Input: head = [4,2,1,3]
Output: [1,2,3,4]

 

Example 2:

Input: head = [-1,5,3,4,0]
Output: [-1,0,3,4,5]

 

Example 3:

Input: head = []
Output: []

 

Constraints:

• The number of nodes in the list is in the range [0, 5 * 104].
• -105 <= Node.val <= 105

Solution

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def sortList(self, head: ListNode) -> ListNode:
        list_nums = []
        
        while head != None:
            list_nums.append(head.val)
            head = head.next
        
        list_nums = sorted(list_nums)
        
        answerList = ListNode(0)
        
        result = answerList
        
        for num in list_nums:
            answerList.next = ListNode(num)
            answerList = answerList.next
        
        return result.next

SOMJANG/CODINGTEST_PRACTICE