zoukankan      html  css  js  c++  java
  • [leetcode]Merge k Sorted Lists

    use smaller heap

    /**
     * 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) {
            priority_queue<ListNode*, vector<ListNode*>, function<bool(ListNode*, ListNode*)> > 
                que([&](ListNode* a, ListNode* b) {return a->val > b->val;});
            for (int i = 0; i < lists.size(); i++) {
                if (lists[i]) que.push(lists[i]);
            }
            ListNode* dummy = new ListNode(-1);
            ListNode* curr = dummy;
            while(!que.empty()) {
                curr->next = que.top();
                curr = curr->next;
                que.pop();
                if (curr->next) {
                    que.push(curr->next);
                }
                curr->next = nullptr;
            }
            return dummy->next;
        }
    };
  • 相关阅读:
    p_value
    p_value
    第一次差异分析
    fdr
    rpkm&map
    rpkm&map
    s
    python数据处理小函数集合
    Jupyter Notebook 的快捷键
    自由度degree of freedom
  • 原文地址:https://www.cnblogs.com/x1957/p/4172796.html
Copyright © 2011-2022 走看看