148. 排序链表
给你链表的头结点 head ,请将其按 升序 排列并返回 排序后的链表 。
你可以在 O(n log n) 时间复杂度和常数级空间复杂度下,对链表进行排序吗?
示例 1:
输入:head = [4,2,1,3]
输出:[1,2,3,4]
示例 2:
输入:head = [-1,5,3,4,0]
输出:[-1,0,3,4,5]
示例 3:
输入:head = []
输出:[]
提示:
链表中节点的数目在范围 [0, 5 * 104] 内
-105 <= Node.val <= 105
/**
* Definition for singly-linked list.
* type ListNode struct {
* Val int
* Next *ListNode
* }
*/
func sortList(head *ListNode) *ListNode {
return sort(head, nil)
}
func sort(head *ListNode, tail *ListNode) *ListNode {
if head == tail {
return head
}
if head.Next == tail {
head.Next = nil
return head
}
slow, fast := head, head
for fast != tail {
slow = slow.Next
fast = fast.Next
if fast != tail {
fast = fast.Next
}
}
mid := slow
return merge(sort(head, mid), sort(mid, tail))
}
func merge(head1 *ListNode, head2 *ListNode) *ListNode{
res := &ListNode{}
tmp, tmp1, tmp2 := res, head1, head2
for tmp1 != nil && tmp2 != nil {
if tmp1.Val <= tmp2.Val {
tmp.Next = tmp1
tmp1 = tmp1.Next
} else {
tmp.Next = tmp2
tmp2 = tmp2.Next
}
tmp = tmp.Next
}
if tmp1 != nil {
tmp.Next = tmp1
} else if tmp2 != nil {
tmp.Next = tmp2
}
return res.Next
}