描述

合并k個排序鏈表，并且返回合并后的排序鏈表。嘗試分析和描述其復雜度。

樣例

給出3個排序鏈表[2->4->null,null,-1->null]，返回 -1->2->4->null

代碼

1.分治 + 歸并排序的思想，NlogK (合并兩個鏈表時間復雜度為 N ，對鏈表組分治時間復雜度為 logK)，自頂向下分治一層層遞歸

/**
 * Definition for ListNode.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int val) {
 *         this.val = val;
 *         this.next = null;
 *     }
 * }
 */ 
public class Solution {
    /**
     * @param lists: a list of ListNode
     * @return: The head of one sorted list.
     */
    public ListNode mergeKLists(List<ListNode> lists) {
        if (lists.size() == 0) {
            return null;
        }
        return mergeHelper(lists, 0, lists.size() - 1);
    }
    
    private ListNode mergeHelper(List<ListNode> lists, int start, int end) {
        // 只有一條鏈表，返回鏈表頭結點
        if (start == end) {
            return lists.get(start);
        }
        
        int mid = start + (end - start) / 2;
        ListNode left = mergeHelper(lists, start, mid);
        ListNode right = mergeHelper(lists, mid + 1, end);
        return mergeTwoLists(left, right);
    }
    
    private ListNode mergeTwoLists(ListNode list1, ListNode list2) {
        ListNode dummy = new ListNode(0);
        ListNode tail = dummy;
        while (list1 != null && list2 != null) {
            if (list1.val < list2.val) {
                tail.next = list1;
                tail = list1;
                list1 = list1.next;
            } else {
                tail.next = list2;
                tail = list2;
                list2 = list2.next;
            }
        }
        if (list1 != null) {
            tail.next = list1;
        } else {
            tail.next = list2;
        }
        
        return dummy.next;
    }
}

2. heap 時間復雜度NlogK
   PriorityQueue

PriorityQueue是基于優先堆的一個無界隊列，本質是一個堆，這個優先隊列中的元素可以默認自然排序或者通過提供的Comparator（比較器）在隊列實例化的時排序。Java默認從小到大順序，Cpp默認從大到小順序。

public class Solution {
    // 自定義Comparator，Comparator方法第一個參數減去第二個參數就是從小到大排序
    private Comparator<ListNode> ListNodeComparator = new Comparator<ListNode>() {
        public int compare(ListNode left, ListNode right) {
            return left.val - right.val;
        }
    };
    
    public ListNode mergeKLists(List<ListNode> lists) {
        if (lists == null || lists.size() == 0) {
            return null;
        }
        
        // 可直接確定PriortyQueue的大小為lists.size()
        // 用最小堆實現PriorityQueue
        Queue<ListNode> heap = new PriorityQueue<ListNode>(lists.size(), ListNodeComparator);
        // K個鏈表的表頭加入heap
        for (int i = 0; i < lists.size(); i++) {
            if (lists.get(i) != null) {
                heap.add(lists.get(i));
            }
        }
        
        ListNode dummy = new ListNode(0);
        ListNode tail = dummy;
        // while執行N次，N是所有結點個數
        // 此處是本算法的精髓
        while (!heap.isEmpty()) {
            // head即為堆的彈出當前最小值結點
            ListNode head = heap.poll();
            tail.next = head;
            tail = head;
            // head結點所在鏈表在head后仍有結點，加入heap，和其余結點比較
            if (head.next != null) {
                heap.add(head.next);
            }
        }
        return dummy.next;
    }
}

3. merge two by two 時間復雜度NlogK，自底向上歸并

/**
 * Definition for ListNode.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int val) {
 *         this.val = val;
 *         this.next = null;
 *     }
 * }
 */ 
public class Solution {
    /**
     * @param lists: a list of ListNode
     * @return: The head of one sorted list.
     */
    public ListNode mergeKLists(List<ListNode> lists) {  
        if (lists == null || lists.size() == 0) {
            return null;
        }
        
        while (lists.size() > 1) {
            List<ListNode> new_lists = new ArrayList<ListNode>();
            // 每兩條鏈表相互合并，合并后鏈表加入new_lists
            // 合并完一輪后list = new_lists，繼續兩兩合并，直到只剩一個鏈表
            for (int i = 0; i + 1 < lists.size(); i += 2) {
                ListNode merged_list = merge(lists.get(i), lists.get(i+1));
                new_lists.add(merged_list);
            }
            // 某一輪合并鏈表個數為奇數時，最后一個鏈表直接加入new_lists
            if (lists.size() % 2 == 1) {
                new_lists.add(lists.get(lists.size() - 1));
            }
            lists = new_lists;
        }
        
        return lists.get(0);
    }
    
    // 合并兩個鏈表
    private ListNode merge(ListNode a, ListNode b) {
        ListNode dummy = new ListNode(0);
        ListNode tail = dummy;
        while (a != null && b != null) {
            if (a.val < b.val) {
                tail.next = a;
                a = a.next;
            } else {
                tail.next = b;
                b = b.next;
            }
            tail = tail.next;
        }
        
        if (a != null) {
            tail.next = a;
        } else {
            tail.next = b;
        }
        
        return dummy.next;
    }
}