23. Merge k Sorted Lists

题目链接：merge-k-sorted-lists

/**
 * 
 * Merge k sorted linked lists and return it as one sorted list. 
 * 
 * Analyze and describe its complexity.
 *
 */

public class MergeKSortedLists {

	public class ListNode {
		int val;
		ListNode next;
		ListNode(int x) {
			val = x;
			next = null;
		}
	}
	
	//分治法 一个一个合并会超时
//	130 / 130 test cases passed.
//	Status: Accepted
//	Runtime: 329 ms
//	Submitted: 0 minutes ago

    public ListNode mergeKLists(List<ListNode> lists) {

//这个合并方法超时
//Status: Time Limit Exceeded    	
//        if(lists.size() == 0) return null;
//        ListNode result = lists.get(0);
//        for( int i = 1; i < lists.size(); i++)
//        	result = mergeTwoLists(result, lists.get(i));
//    	return result;
 
    	
    	//分治法 不超时
//    	130 / 130 test cases passed.
//    	Status: Accepted
//    	Runtime: 329 ms
//    	Submitted: 0 minutes ago    	
    	int size = lists.size();
        if(size == 0) return null;
        else if(size == 1) return lists.get(0);
        else if(size == 2) return mergeTwoLists(lists.get(0), lists.get(1));
        else return mergeTwoLists(mergeKLists(lists.subList(0, size / 2)), mergeKLists(lists.subList(size / 2, size)));  
    }
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
    	ListNode head = new ListNode(-1);
        ListNode cursor = head;
        while(l1 != null && l2 != null) {
        	if(l1.val <= l2.val) {
        		cursor.next = l1;
        		l1 = l1.next;
        	} else {
				cursor.next = l2;
				l2 =l2.next;
			}
        	cursor = cursor.next;
        }
        cursor.next = (l1 == null) ? l2 : l1;      
        return head.next; 
    }
    
	public static void main(String[] args) {
		// TODO Auto-generated method stub

	}

}