LeetCode---23. Merge k Sorted Lists

合并k个有序列表

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    //归并排序的思想， 结合这道题148. Sort List
    //现将k个列表做分半操作，然后将每两个列表合并，递归
    public ListNode mergeKLists(ListNode[] lists) {
        return mergeSort(lists, 0, lists.length-1);
    }
    public ListNode mergeSort(ListNode[] lists, int s, int e){
        if(s==e)
            return lists[s];
        if(s<e){
            int mid = (s+e)/2;
            ListNode l1 = mergeSort(lists, s, mid);
            ListNode l2 = mergeSort(lists, mid+1, e);
            return merge(l1, l2);
        }else{
            return null;
        }
    }
    public 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;
        }
    }
}