23. 合并K个排序链表

https://leetcode-cn.com/problems/merge-k-sorted-lists/description/

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

示例:

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

/**
 * 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) {
		vector<int> v;
		for (size_t i = 0; i < lists.size(); ++i) {
			while (lists[i]) {
				v.push_back(lists[i]->val);
				lists[i] = lists[i]->next;
			}
		}
		sort(v.begin(), v.end());
		ListNode* Head = new ListNode(0);
		ListNode* cur = Head;
		for (size_t i = 0; i < v.size(); ++i) {
			cur->next = new ListNode(v[i]);
			cur = cur->next;
		}
		return Head->next;
	}
};