在 O(n log n) 时间复杂度和常数级空间复杂度下,对链表进行排序。
示例 1:
输入: 4->2->1->3
输出: 1->2->3->4
示例 2:
输入: -1->5->3->4->0
输出: -1->0->3->4->5
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/sort-list
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode sortList(ListNode head) {
if(head==null || head.next==null) return head;
return mergeSort(head);
}
//看不懂
private ListNode mergeSort(ListNode head){
if(head.next==null) return head;
ListNode slow = head, fast = head, pre = null;
while(fast!=null && fast.next!=null){
pre = slow;
slow = slow.next;
fast = fast.next.next;
}
pre.next = null;
ListNode l = mergeSort(head);
ListNode r = mergeSort(slow);
return merge(l, r);
}
private ListNode merge(ListNode l,ListNode r){
ListNode dummy = new ListNode(-1);
ListNode p = dummy;
while(r!=null && l!=null){
if(r.val<l.val){
p.next = r;
r = r.next;
}else{
p.next = l;
l = l.next;
}
p = p.next;
}
p.next = (l==null) ? r : l;
return dummy.next;
}
}