解题思路
按照归并的思想,和归并排序类似,不断地合并左右2边即可。
代码如下(java)
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode mergeKLists(ListNode[] lists) {
if(lists==null || lists.length==0 )
return null;
if(lists.length == 1)
return lists[0];
return helper(0,lists.length-1,lists);
}
public ListNode helper(int start, int end,ListNode[] lists){
if(start>=end)
return lists[end];
// if(end-start==1)
// return merge(lists[start],lists[end]);
int mid = (end-start)/2+start;
ListNode left = helper(start,mid,lists);
ListNode right = helper(mid+1,end,lists);
ListNode head = merge(left,right);
return head;
}
public ListNode merge(ListNode l1,ListNode l2) {
if(l1 == null)
return l2;
if(l2==null)
return l1;
ListNode head = null;
if(l1.val <= l2.val){
head = new ListNode(l1.val);
head.next = merge(l1.next,l2);
}else{
head = new ListNode(l2.val);
head.next = merge(l1,l2.next);
}
return head;
}
}