LeetCode（23）：合并K个排序链表 Merge k Sorted Lists（Java）

2019.6.7 #程序员笔试必备# LeetCode 从零单刷个人笔记整理（持续更新）

合并两个有序链表可以很容易地想到归并排序的方法。合并K个有序链表需要分治+归并，对K个链表进行分治，对分治后的链表两两归并排序即可。

---

传送门：合并K个排序链表

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

合并 k 个排序链表，返回合并后的排序链表。请分析和描述算法的复杂度。

示例:
输入:
[
  1->4->5,
  1->3->4,
  2->6
]
输出: 1->1->2->3->4->4->5->6

---

/**
 * 
 * @author ChopinXBP
 * Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.
 * 合并 k 个排序链表，返回合并后的排序链表。请分析和描述算法的复杂度。
 *
 */

public class MergekSortedLists {


	public class ListNode {
		int val;
		ListNode next;

		ListNode(int x) {
			val = x;
		}
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub

	}

    public ListNode mergeKLists(ListNode[] lists) {
        if(lists == null || lists.length == 0) return null;
        
        return mergeSolution(lists, 0, lists.length - 1);
    }
    
    public ListNode mergeSolution(ListNode[] lists, int begin, int end) {
    	if(begin == end) {
    		return lists[begin];
    	}else {
    		int mid = (begin + end) >> 1;
    		ListNode l1 = mergeSolution(lists, begin, mid);
    		ListNode l2 = mergeSolution(lists, mid + 1, end);
    		return mergeTwoLists(l1, l2);
    	}
    }
    
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
    	if(l1 == null && l2 == null)return null;
    	if(l1 == null) return l2;
    	if(l2 == null) return l1;
    	
    	ListNode result = new ListNode(-1);
    	ListNode p = result;
    	ListNode pl1 = l1;
    	ListNode pl2 = l2;
    	while(pl1 != null && pl2 != null) {
    		if(pl1.val < pl2.val) {
    			p.next = pl1;
    			pl1 = pl1.next;
    		}else {
    			p.next = pl2;
    			pl2 = pl2.next;
    		}
    		p = p.next;
    	}
    	
    	if(pl1 == null) {
    		p.next = pl2;
    	}
    	if(pl2 == null) {
    		p.next = pl1;
    	}
    	
    	return result.next;
    }
}

---

#Coding一小时，Copying一秒钟。留个言点个赞呗，谢谢你#