合并K个排序链表

/**
 * 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) {
        if(lists.empty())
            return nullptr;
        
        for(int i=1;i<lists.size();++i)
            mergeLists(lists[0],lists[i]);
        
        return lists[0];
    }
private:
    ListNode* mergeLists(ListNode* &l1,ListNode *l2)
    {
        if(!l1&&!l2)
            return nullptr;
        else if(!l1||!l2)
            return l1?l1:l1=l2;
       
        ListNode* head=new ListNode(-1);
        ListNode* H=head;
        while(l1&&l2)
        {
            if(l1->val<=l2->val)
            {
                H->next=l1;
                H=H->next;
                l1=l1->next;
            }
            else
            {
                H->next=l2;
                H=H->next;
                l2=l2->next;
            }
        }
        H->next=l1?l1:l2;
        l1=head->next;
        head->next=nullptr;
        delete head;
        return l1;
    }
};

/**
 * 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) {
        if(lists.empty())
            return nullptr;
        
        ListNode head(-1);
        ListNode *H=&head;
        make_heap(lists.begin(),lists.end(),cmpNode);
        while(!lists.empty()&&lists.front())
        {
            pop_heap(lists.begin(),lists.end(),cmpNode);
            H->next=lists.back();
            H=H->next;
            lists.back()=lists.back()->next;
            if(!lists.back())
                lists.pop_back();
            else
                make_heap(lists.begin(),lists.end(),cmpNode);
        }
        return head.next;
    }
    static bool cmpNode(ListNode *l1,ListNode *l2)
    {
        if(!l1||!l2)
            return !l1?true:false;
        
        return l1->val>=l2->val;
    }
};