23. Merge k Sorted Lists

2019独角兽企业重金招聘Python工程师标准>>>

package com.lifeibigdata.algorithms.leetcode;

import java.util.ArrayList;
import java.util.List;

/**
 * Created by lifei on 16/5/30.
 *
 * 1 转化为两两合并
 */
public class MergeKLists {

    public static void main(String[] args) {
        ListNode l1 = new ListNode(1);
        ListNode n1 = new ListNode(3);
        ListNode n2 = new ListNode(4);
        ListNode l2 = new ListNode(5);

        l1.next = n1;
        n1.next = n2;

        List<ListNode> lists = new ArrayList<>();
        lists.add(l1);
        lists.add(l2);

        MergeKLists mt = new MergeKLists();
        ListNode head = mt.mergeKLists(lists);
        System.out.println(head.val);
        System.out.println(head.next.val);
    }

    ListNode merge2Lists(ListNode list1, ListNode list2) {
        ListNode head    = new ListNode(-1);
        ListNode current = head;
        while(list1!=null&&list2!=null) {
            if(list1.val<list2.val) {
                current.next = list1;
                list1   = list1.next;
            } else {
                current.next = list2;
                list2   = list2.next;
            }
            current = current.next;
        }
        if(list1!=null) {
            current.next = list1;
        } else {
            current.next = list2;
        }
        return head.next;
    }
    public ListNode mergeKLists(List<ListNode> lists) {
        if(lists==null||lists.size()==0) {
            return null;
        }
        if(lists.size()==1) {
            return lists.get(0);
        }
        int length = lists.size() ;
        int mid = (length - 1)/2 ;
        ListNode l1 = mergeKLists(lists.subList(0,mid + 1)) ;
        ListNode l2 = mergeKLists(lists.subList(mid + 1,length)) ;

        return merge2Lists(l1,l2) ;
    }

}

转载于:https://my.oschina.net/datacube/blog/703547