Merge k Sorted Lists

用到优先队列。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    struct Compare
    {
        bool operator()(ListNode *a, ListNode *b)
        {
            return a->val > b->val;
        }
    };
    ListNode *mergeKLists(vector<ListNode *> &lists) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        priority_queue<ListNode*, vector<ListNode*>, Compare> queue;
        for(int i = 0; i < lists.size(); i ++)
        {
            if(lists[i])
                queue.push(lists[i]);
        }
        ListNode *root = new ListNode(0), *p;
        p = root;
        while(!queue.empty())
        {
            ListNode *tmp = queue.top();
            queue.pop();
            if(tmp->next) queue.push(tmp->next);
            p->next = tmp;
            p = tmp;
        }
        return root->next;
    }
};