Merge k Sorted Lists

1) 复习下merge sort的各个部分怎么写

2） 注意每个method的返回值

ref http://www.cnblogs.com/springfor/p/3869217.html

public class Solution {
    // ref http://www.cnblogs.com/springfor/p/3869217.html
    public ListNode mergeKLists(ArrayList<ListNode> lists) {
        if(lists==null || lists.size()==0) return null;
        return Msort(0,lists.size()-1,lists);
    }
     
     <strong><span style="color:#ff0000;">public ListNode Msort(int start, int end, ArrayList<ListNode> lists){
         if(start<end){
             int mid = start + (end-start)/2;
             ListNode left = Msort(start, mid,lists);
             ListNode right = Msort(mid+1, end,lists);
             return merge2Lists(left, right);
         }
         return lists.get(start);
     }</span></strong>
         
    public ListNode merge2Lists(ListNode n1, ListNode n2){
        if(n1==null) return n2;
        if(n2==null) return n1;
        
        ListNode cur = new ListNode(-1);
        ListNode t =cur;
        
        while(n1!=null && n2!=null){
            if(n1.val<n2.val){
                cur.next = n1;
                cur = cur.next;
                n1 = n1.next;
            }else {
                cur.next = n2;
                cur = cur.next;
                n2 = n2.next;
            }
        }
        
        if(n1!=null) cur.next = n1;
        if(n2!=null) cur.next = n2;
        return t.next;
        
    }
}