Leetcode 148. 排序链表

148. 排序链表

Ideas

算法：排序
数据结构：链表
直接读到列表里排序再写回原链表

Code

# 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: Optional[ListNode]) -> Optional[ListNode]:
        nums = []
        node = head
        while node:
            nums.append(node.val)
            node = node.next
        nums.sort()
        node = head
        for i in nums:
            node.val = i
            node = node.next
        return head