题目描述
Sort a linked list in O(n log n) time using constant space complexity.
Example 1:
Input: 4->2->1->3
Output: 1->2->3->4
Example 2:
Input: -1->5->3->4->0
Output: -1->0->3->4->5
方法思路
class Solution{
//Runtime: 3 ms, faster than 99.30% of Java
//Memory Usage: 40.5 MB, less than 93.70%
//step 1. cut the list to two halves
//step 2. sort each half
//step 3. merge l1 and l2
public ListNode sortList(ListNode head){
if(head == null || head.next == null)
return head;
step 1. cut the list to two halves
ListNode prev = null, slow = head, fast = head;
while(fast != null && fast.next != null){
prev = slow;
slow = slow.next;
fast = fast.next.next;
}
prev.next = null;
//step 2. sort each half
ListNode l1 = sortList(head);
ListNode l2 = sortList(slow);
//step 3. merge l1 and l2
return merge(l1, l2);
}
public ListNode merge(ListNode l1, ListNode l2){
ListNode head = new ListNode(0), handler = head;
while(l1 != null && l2 != null){
if(l1.val <= l2.val){
handler.next = l1;
l1 = l1.next;
}else{
handler.next = l2;
l2 = l2.next;
}
handler = handler.next;
}
if(l1 != null)
handler.next = l1;
else
handler.next = l2;
return head.next;
}
}