题目:23. Merge k Sorted Lists 合并k个排序的list
难度:困难
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.
Example:
Input: [ 1->4->5, 1->3->4, 2->6 ] Output: 1->1->2->3->4->4->5->6
题意解析:
将k个有序的list进行合并然后返回一个排好序的list
解题思路一:
依次合并,时间复杂度较高。
public ListNode mergeKLists(ListNode[] lists) {
if (lists.length == 0)
return null;
if(lists.length == 1)
return lists[0];
else {
ListNode listNode = lists[0];
ListNode node = listNode;
for (int i = 1; i < lists.length; i++) {
ListNode listNode1 = mergeTwoLists(listNode, lists[i]);
listNode = listNode1;
}
return listNode;
}
}
public ListNode mergeTwoLists(ListNode l1, ListNode l2){
if(l1 == null) return l2;
if(l2 == null) return l1;
if(l1.val <= l2.val){
l1.next = mergeTwoLists(l1.next,l2);
return l1;
}else{
l2.next = mergeTwoLists(l1,l2.next);
return l2;
}
}
提交代码之后:
Runtime: 297 ms, faster than 5.05% of Java online submissions for Merge k Sorted Lists.
Memory Usage: 48.3 MB, less than 5.60% of Java online submissions for Merge k Sorted Lists.
解题思路二:
采用归并的思想,将其进行拆分,然后两两合并。
public ListNode mergeKLists(ListNode[] lists) {
return partion(lists,0,lists.length-1);
}
public static ListNode partion(ListNode[] lists,int s,int e){
if(s==e) return lists[s];
if(s<e){
int q=(s+e)/2;
ListNode l1=partion(lists,s,q);
ListNode l2=partion(lists,q+1,e);
return merge(l1,l2);
}else
return null;
}
//This function is from Merge Two Sorted Lists.
public static ListNode merge(ListNode l1,ListNode l2){
if(l1==null) return l2;
if(l2==null) return l1;
if(l1.val<l2.val){
l1.next=merge(l1.next,l2);
return l1;
}else{
l2.next=merge(l1,l2.next);
return l2;
}
}
提交代码之后:
Runtime: 3 ms, faster than 92.98% of Java online submissions for Merge k Sorted Lists.
Memory Usage: 41.6 MB, less than 12.34% of Java online submissions for Merge k Sorted Lists.