148. 排序链表
给你链表的头结点 head ,请将其按 升序 排列并返回 排序后的链表 。
示例 1:
输入:head = [4,2,1,3]
输出:[1,2,3,4]
示例 2:
输入:head = [-1,5,3,4,0]
输出:[-1,0,3,4,5]
示例 3:
输入:head = []
输出:[]
class ListNode:
def __init__(self, val=0, next=None):
self.val = val
self.next = next
def sortList(head):
if not head or not head.next:
return head
values =[]
while head:
values.append(head.val)
head = head.next
values.sort()
new_head = ListNode(values[0])
current = new_head
for val in values[1:]:
current.next = ListNode(val)
current = current.next
return new_head