{"id":1129,"date":"2015-06-27T07:39:57","date_gmt":"2015-06-26T23:39:57","guid":{"rendered":"http:\/\/www.shuizilong.com\/house\/?p=1129"},"modified":"2015-06-28T18:50:31","modified_gmt":"2015-06-28T10:50:31","slug":"leetcode-23-merge-k-sorted-lists","status":"publish","type":"post","link":"https:\/\/www.shuizilong.com\/house\/archives\/leetcode-23-merge-k-sorted-lists\/","title":{"rendered":"LeetCode 23. Merge k Sorted Lists"},"content":{"rendered":"<p><!--more--><br \/>\n<a href=\"https:\/\/leetcode.com\/problems\/merge-k-sorted-lists\/\">https:\/\/leetcode.com\/problems\/merge-k-sorted-lists\/<\/a><\/p>\n<li>\u505a\u6cd5\u4e00\uff1a\u5206\u6cbb<\/li>\n<p>\u7c7b\u4f3c\u5f52\u5e76\u6392\u5e8f\uff0c\u6bcf\u6b21\u5206\u4e24\u534a\u9012\u5f52\uff0c\u7136\u540e\u7528 <a href=\"https:\/\/www.shuizilong.com\/house\/archives\/leetcode-21-merge-two-sorted-lists\/\n\">\u524d\u4e00\u9898<\/a> \u7684\u4ee3\u7801\u5408\u5e76\u8d77\u6765\u3002\u590d\u6742\u5ea6 T(n) = 2T(n\/2) + O(kn)\u3002<\/p>\n<pre class=\"brush: jscript; light: false; title: Javascript; toolbar: true; notranslate\" title=\"Javascript\">\r\n\/**\r\n * Definition for singly-linked list.\r\n * function ListNode(val) {\r\n *     this.val = val;\r\n *     this.next = null;\r\n * }\r\n *\/\r\n\/**\r\n * @param {ListNode&#x5B;]} lists\r\n * @return {ListNode}\r\n *\/\r\n \r\n\r\nvar mergeTwoLists = function(l1, l2) {\r\n    var head = new ListNode(0), ptr = head;\r\n    \r\n    while (l1 !== null || l2 !== null){\r\n        if (l1 !== null &amp;&amp; (l2 === null || l1.val &lt; l2.val)){\r\n            ptr.next = new ListNode(l1.val);\r\n            l1 = l1.next;\r\n        }\r\n        else{\r\n            ptr.next = new ListNode(l2.val);\r\n            l2 = l2.next;\r\n        }\r\n        ptr = ptr.next;\r\n    }\r\n    \r\n    return head.next;\r\n};\r\n\r\n \r\nvar mergeKLists = function(lists) {\r\n    var k = lists.length;\r\n    if (k == 0) return null;\r\n    if (k == 1) return lists&#x5B;0];\r\n    \r\n    var m = k \/ 2;\r\n    var l = mergeKLists(lists.slice(0, m));\r\n    var r = mergeKLists(lists.slice(m));\r\n    return mergeTwoLists(l, r);\r\n};\r\n<\/pre>\n<li>\u505a\u6cd5\u4e8c\uff1a\u4f18\u5148\u961f\u5217<\/li>\n<p>\u590d\u6742\u5ea6\u4e00\u6837\u3002<\/p>\n<pre class=\"brush: cpp; light: false; title: ; toolbar: true; notranslate\" title=\"\">\r\n\/**\r\n * Definition for singly-linked list.\r\n * struct ListNode {\r\n *     int val;\r\n *     ListNode *next;\r\n *     ListNode(int x) : val(x), next(NULL) {}\r\n * };\r\n *\/\r\n \r\n#define REP(i, n) for (int i=0;i&lt;n;++i)\r\ntypedef pair&lt;int, int&gt; PII;\r\npriority_queue&lt;PII, vector&lt;PII&gt;, greater&lt;PII&gt;&gt; Q;\r\n\r\nclass Solution {\r\npublic:\r\n    ListNode* mergeKLists(vector&lt;ListNode*&gt;&amp; lists) {\r\n        \r\n        int k = lists.size(); REP(i, k) if (lists&#x5B;i] != nullptr) Q.push(make_pair(lists&#x5B;i]-&gt;val, i));\r\n        \r\n        ListNode* head = new ListNode(0), *ptr = head;\r\n        \r\n        while (!Q.empty()){\r\n            ptr-&gt;next = new ListNode(Q.top().first); ptr = ptr-&gt;next;\r\n            int i = Q.top().second; lists&#x5B;i] = lists&#x5B;i]-&gt;next;\r\n            if (lists&#x5B;i] != nullptr) Q.push(make_pair(lists&#x5B;i]-&gt;val, i));\r\n            Q.pop();\r\n        }\r\n        \r\n        return head-&gt;next;\r\n    }\r\n};\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","enabled":false}}},"categories":[142],"tags":[],"class_list":["post-1129","post","type-post","status-publish","format-standard","hentry","category-leetcode"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p2tdP7-id","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/1129","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/comments?post=1129"}],"version-history":[{"count":0,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/1129\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/media?parent=1129"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/categories?post=1129"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/tags?post=1129"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}