{"id":1487,"date":"2024-11-12T19:51:29","date_gmt":"2024-11-12T11:51:29","guid":{"rendered":"http:\/\/114.55.108.251\/?p=1487"},"modified":"2024-11-14T17:24:35","modified_gmt":"2024-11-14T09:24:35","slug":"leetcode-hot100%e5%a0%86","status":"publish","type":"post","link":"https:\/\/guapicoding.com\/?p=1487","title":{"rendered":"LeetCode hot100@\u5806"},"content":{"rendered":"\n<p><strong>\u4f18\u5148\u961f\u5217\uff1a<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>\u5927\u6839\u5806\uff1a<code>priority_queue&lt;int> maxHeap;<\/code><\/li>\n\n\n\n<li>\u5c0f\u6839\u5806\uff1a<code>priority_queue&lt;int, vector&lt;int>, greater&lt;int>> minHeap;<\/code><\/li>\n<\/ul>\n\n\n\n<p><strong>\u81ea\u5b9a\u4e49\u6bd4\u8f83\u5668\uff1a<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>struct Comparator {  \n    bool operator()(ListNode *a,ListNode *b) {\n        return a->val > b->val; \/\/\u4ee3\u8868\u5c0f\u6839\u5806\uff0c\u56e0\u4e3a\u5982\u679c\u8fd4\u56detrue\uff0c\u5c31\u8868\u793a\u5de6\u4fa7\u5143\u7d20\u7684\u4f18\u5148\u7ea7\u4f4e\u4e8e\u53f3\u4fa7\u5143\u7d20(\u6709\u70b9\u53cd\u76f4\u89c9)\n    }\n};\npriority_queue&lt;ListNode*, vector&lt;ListNode* >, Comparator> queue;<\/code><\/pre>\n\n\n\n<p>\u203b<strong>\u627e\u7b2ck\u5927\/\u524dk\u5927\u5143\u7d20\u4f18\u5148\u4f7f\u7528\u5c0f\u6839\u5806\uff0c\u53cd\u4e4b\u4ea6\u7136<\/strong><\/p>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\"\/>\n\n\n\n<h2 class=\"wp-block-heading\"><a href=\"https:\/\/leetcode.cn\/problems\/kth-largest-element-in-an-array\/\">215. \u6570\u7ec4\u4e2d\u7684\u7b2cK\u4e2a\u6700\u5927\u5143\u7d20<\/a>\u2705<\/h2>\n\n\n\n<p><strong><em>Solution1\u5927\u6839\u5806\uff1a\u628a\u6240\u6709\u5143\u7d20\u538b\u5165\u5806\uff0c\u518d\u5f39\u51fak-1\u4e2a\u5143\u7d20\uff0c\u6b64\u65f6\u5806\u9876\u5c31\u662f\u7b2ck\u5927\u7684\u5143\u7d20\uff08\u6027\u80fd\u6bd4\u5c0f\u6839\u5806\u5dee\uff0c\u9700\u8981\u4e0d\u65ad\u8c03\u6574\u5927\u6839\u5806\u7684\u5806\u9876\u6765\u6392\u9664\u8f83\u5c0f\u7684\u5143\u7d20<\/em><\/strong>\uff09<\/p>\n\n\n\n<p><strong><em>Solution2\u5c0f\u6839\u5806\uff1a\u7ef4\u62a4\u4e00\u4e2a\u5bb9\u91cf\u4e3ak\u7684\u5c0f\u6839\u5806\uff0c\u5728\u5bb9\u91cf\u8fbe\u5230k\u540e\uff0c\u5143\u7d20\u5927\u4e8e\u5806\u9876\u5143\u7d20\u624d\u80fd\u538b\u5165\u5806\uff0c\u904d\u5386\u5b8c\u6240\u6709\u5143\u7d20\u540e\u5806\u9876\u5c31\u662f\u7b2ck\u5927\u7684\u5143\u7d20<\/em><\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>class Solution1 {\npublic:\n    int findKthLargest(vector&lt;int>&amp; nums, int k) {\n        priority_queue&lt;int> maxHeap;\n        \n        for(const auto &amp;i : nums) maxHeap.push(i);\n        while(--k) maxHeap.pop(); \/\/\u6ce8\u610f\u4e0d\u662fk--\n\n        return maxHeap.top();\n    }\n};<\/code><\/pre>\n\n\n\n<pre class=\"wp-block-code\"><code>class Solution2 {\npublic:\n    int findKthLargest(vector&lt;int>&amp; nums, int k) {\n        priority_queue&lt;int, vector&lt;int>, greater&lt;int>> minHeap;\n\n        for(const auto &amp;i : nums) {\n            if(minHeap.size() &lt; k || minHeap.top() &lt; i) {\n                minHeap.push(i);\n                if(minHeap.size() > k) minHeap.pop(); \/\/\u8d85\u51fa\u5bb9\u91cf\u65f6\u5f39\u51fa\u6700\u5c0f\u5143\u7d20\n            }       \n        }\n \n        return minHeap.top();\n    }\n};<\/code><\/pre>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\"\/>\n\n\n\n<h2 class=\"wp-block-heading\"><a href=\"https:\/\/leetcode.cn\/problems\/top-k-frequent-elements\/\">347. \u524d K \u4e2a\u9ad8\u9891\u5143\u7d20<\/a>\u274c<\/h2>\n\n\n\n<p><em><strong>map\u7528\u6765\u901a\u8fc7\u5143\u7d20\u6620\u5c04\u5230\u6570\u91cf\uff0c\u5806\u91cc\u5b58pair\u7528\u6765\u901a\u8fc7\u6570\u91cf\u6620\u5c04\u5230\u5143\u7d20<\/strong><\/em><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>class Solution {\npublic:\n    struct Comparator {  \n        bool operator()(const pair&lt;int, int> &amp;a, const pair&lt;int, int> &amp;b) {\n            return a.second > b.second; \/\/\u5b9a\u4e49\u5c0f\u6839\u5806\n        }\n    };\n    vector&lt;int> topKFrequent(vector&lt;int>&amp; nums, int k) {\n        vector&lt;int> res(k);\n        unordered_map&lt;int ,int> mp;\n        priority_queue&lt;pair&lt;int, int>, vector&lt;pair&lt;int, int>>, Comparator> minHeap;\n\n        for(const auto &amp;i : nums) mp&#91;i]++;\n\n        for(unordered_map&lt;int ,int>::iterator it = mp.begin(); it != mp.end(); it++) {\n            if(minHeap.size() &lt; k || it->second > minHeap.top().second) {\n                minHeap.push(*it);\n                if(minHeap.size() > k) minHeap.pop();\n            }            \n        }\n        \n        for(int i = k - 1; i >= 0; i--) {\n            res&#91;i] = minHeap.top().first;\n            minHeap.pop();\n        }\n\n        return res;\n    }\n};<\/code><\/pre>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\"\/>\n\n\n\n<h2 class=\"wp-block-heading\"><a href=\"https:\/\/leetcode.cn\/problems\/find-median-from-data-stream\/\">295. \u6570\u636e\u6d41\u7684\u4e2d\u4f4d\u6570<\/a>\u274c<\/h2>\n\n\n\n<p><strong><em>\u4e00\u4e2a\u5c0f\u9876\u5806\u548c\u4e00\u4e2a\u5927\u9876\u5806\uff0c\u5404\u4fdd\u5b58\u6570\u7ec4\u7684\u4e00\u534a\u5143\u7d20<\/em><\/strong><\/p>\n\n\n\n<p><strong><em>\u5927\u6839\u5806\u4fdd\u5b58\u8f83\u5c0f\u7684\u4e00\u534a \u5c0f\u6839\u5806\u4fdd\u5b58\u8f83\u5927\u7684\u4e00\u534a<\/em><\/strong><\/p>\n\n\n\n<p><strong>\u9898\u89e3\u4e2d\u6bcf\u6b21\u63d2\u5165\u5143\u7d20\u4e0d\u7528\u6bd4\u8f83\u5927\u5c0f\u7684\u539f\u56e0\u662f\uff1a<\/strong>\u6b64\u65f6\u6765\u4e86\u4e00\u4e2a\u65b0\u7684\u5143\u7d20\uff0c\u6211\u60f3\u63d2\u5165\u5c0f\u6839\u5806\uff0c\u6709\u4e24\u79cd\u60c5\u51b5\uff0c\u7b2c\u4e00\u79cd\u4ed6\u6bd4\u5927\u6839\u5806\u7684\u5806\u9876\u5143\u7d20\u5927\uff0c\u6b64\u65f6\u7406\u8bba\u4e0a\u53ef\u4ee5\u76f4\u63a5\u63d2\u5165\u5c0f\u6839\u5806\uff08\u4fdd\u5b58\u8f83\u5927\u7684\u4e00\u534a\u5143\u7d20\uff09\uff1b\u7b2c\u4e8c\u79cd\u60c5\u51b5\uff0c\u4ed6\u6bd4\u5927\u6839\u5806\u7684\u5806\u9876\u5143\u7d20\u5c0f\uff0c\u6b64\u65f6\u5c31\u4e0d\u80fd\u76f4\u63a5\u63d2\u5165\u5c0f\u6839\u5806\uff0c\u9700\u8981\u5148\u63d2\u5165\u5927\u6839\u5806\u7ef4\u6301\u8f83\u5c0f\u7684\u5143\u7d20\u90fd\u5728\u5927\u6839\u5806\u5185\uff0c\u7136\u540e\u53d6\u5927\u6839\u5806\u7684\u5806\u9876\u5143\u7d20\u63d2\u5165\u5c0f\u6839\u5806\u3002\u4e3a\u4e86\u7edf\u4e00\u64cd\u4f5c\uff0c\u56de\u5230\u7b2c\u4e00\u79cd\u60c5\u51b5\uff0c\u53ef\u4ee5\u5148\u7edf\u4e00\u628a\u5143\u7d20\u63d2\u5165\u5927\u6839\u5806\uff0c\u7136\u540e\u6b64\u65f6\u5927\u6839\u5806\u57fa\u4e8e\u81ea\u8eab\u7684\u7ed3\u6784\u7279\u6027\uff0c\u4f1a\u5c06\u8be5\u5143\u7d20\u4f5c\u4e3a\u65b0\u7684\u5806\u9876\u5143\u7d20\uff0c\u6b64\u65f6\u518d\u6267\u884c\u63d2\u5165\u5c0f\u6839\u5806\u7684\u64cd\u4f5c\u5c31\u76f8\u5f53\u4e8e\u6b64\u524d\u5728\u5927\u6839\u5806\u5904\u8fc7\u6e21\u4e86\u4e00\u4e0b\uff0c\u6700\u7ec8\u8fd8\u662f\u4f1a\u63d2\u5165\u5c0f\u6839\u5806\uff08\u592a\u2122\u5de7\u5999\u4e86\uff09<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>class MedianFinder {\nprivate:\n    priority_queue&lt;int> maxHeap; \/\/\u5927\u6839\u5806 \u4fdd\u5b58\u8f83\u5c0f\u7684\u4e00\u534a\n    priority_queue&lt;int, vector&lt;int>, greater&lt;int>> minHeap; \/\/\u5c0f\u6839\u5806 \u4fdd\u5b58\u8f83\u5927\u7684\u4e00\u534a\npublic:\n    MedianFinder() {\n    }\n    \n    void addNum(int num) {  \/\/\u4e24\u8fb9\u5143\u7d20\u6570\u91cf\u76f8\u7b49\u65f6\u4f18\u5148\u538b\u5165\u5c0f\u6839\u5806\n        if(minHeap.size() != maxHeap.size()) {\n            minHeap.push(num);\n            maxHeap.push(minHeap.top());\n            minHeap.pop();\n        } else {\n            maxHeap.push(num);\n            minHeap.push(maxHeap.top());\n            maxHeap.pop();\n        }\n    }\n    \n    double findMedian() {\n        return minHeap.size() != maxHeap.size() ? minHeap.top() : (minHeap.top() + maxHeap.top()) \/ 2.0;\n\n    }\n};<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"<p>\u4f18\u5148\u961f\u5217\uff1a \u81ea\u5b9a\u4e49\u6bd4\u8f83\u5668\uff1a \u203b\u627e\u7b2ck\u5927\/\u524dk\u5927\u5143\u7d20\u4f18\u5148\u4f7f\u7528\u5c0f\u6839\u5806\uff0c\u53cd\u4e4b\u4ea6\u7136 215. \u6570\u7ec4\u4e2d\u7684\u7b2cK\u4e2a\u6700\u5927\u5143\u7d20\u2705 [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3],"tags":[18,54,19,53],"class_list":["post-1487","post","type-post","status-publish","format-standard","hentry","category-suanfa","tag-leetcode","tag-54","tag-19","tag-53"],"_links":{"self":[{"href":"https:\/\/guapicoding.com\/index.php?rest_route=\/wp\/v2\/posts\/1487","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/guapicoding.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/guapicoding.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/guapicoding.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/guapicoding.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1487"}],"version-history":[{"count":16,"href":"https:\/\/guapicoding.com\/index.php?rest_route=\/wp\/v2\/posts\/1487\/revisions"}],"predecessor-version":[{"id":1525,"href":"https:\/\/guapicoding.com\/index.php?rest_route=\/wp\/v2\/posts\/1487\/revisions\/1525"}],"wp:attachment":[{"href":"https:\/\/guapicoding.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1487"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/guapicoding.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1487"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/guapicoding.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1487"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}