排序
class Solution {
public:
ListNode* mergeKLists(vector<ListNode*>& lists) {
ListNode* ans = new ListNode(0);
ListNode* now = ans;
vector<int> nums;
int index = 0;
for (int i = 0; i < lists.size(); ++i)
{
ListNode *p = lists[i];
while(p) {
nums.push_back(p->val);
p = p->next;
}
}
sort(nums.begin(), nums.end());
for (int i = 0; i < nums.size(); ++i)
{
now->next = new ListNode(nums[i]);
now = now->next;
}
return ans->next;
}
};