题解 | #单链表的排序#

# 转成list再排序，再转成listNode 取巧 简单！！！
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param head ListNode类 the head node
# @return ListNode类
#
class Solution:
    
    def sortInList(self , head: ListNode) -> list:
        nums = []
        while head:
            nums.append(head.val)
            head = head.next
        nums.sort()
        node = ListNode(-1)
        phead = node
        for val in nums:
            cur = ListNode(val)
            node.next = cur
            node = node.next
        return phead.next