23. Merge k Sorted Lists

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

解题思路：

复用21. Merge Two Sorted Lists的代码，链表两两合并，直到最后只剩一个链表为止。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* mergeKLists(vector<ListNode*>& lists) {
        int len = lists.size();

        if (len == 0) return NULL;

        while (lists.size() > 1) {
            ListNode *p1 = lists.front();
            lists.erase(lists.begin());
            ListNode *p2 = lists.front();
            lists.erase(lists.begin());
            lists.push_back(mergeTwoLists(p1, p2));
        }
        return lists[0];
    }

    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
        ListNode dummy(-1);
        ListNode *cur = &dummy;

        while (l1 != NULL && l2 != NULL) {
            if (l1->val < l2->val) {
                cur->next = l1;
                l1 = l1->next;
            }
            else {
                cur->next = l2;
                l2 = l2->next;
            }

            cur = cur->next;
        }

        while (l1 != NULL) {
            cur->next = l1;
            l1 = l1->next;
            cur = cur->next;
        }

        while (l2 != NULL) {
            cur->next = l2;
            l2 = l2->next;
            cur = cur->next;
        }

        return dummy.next;
    }
};