{"id":2487,"date":"2024-09-30T19:17:27","date_gmt":"2024-09-30T11:17:27","guid":{"rendered":"https:\/\/guapicoding.com\/?p=2487"},"modified":"2025-03-03T22:05:53","modified_gmt":"2025-03-03T14:05:53","slug":"leetcode-hot100%e4%ba%8c%e5%88%86%e6%9f%a5%e6%89%be","status":"publish","type":"post","link":"https:\/\/guapicoding.com\/?p=2487","title":{"rendered":"LeetCode hot100@\u4e8c\u5206\u67e5\u627e"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\"><a href=\"https:\/\/leetcode.cn\/problems\/search-insert-position\/\">35. \u641c\u7d22\u63d2\u5165\u4f4d\u7f6e<\/a>\u2705 <\/h2>\n\n\n\n<p><strong><em>\u4e8c\u5206\u6a21\u677f\u9898<\/em><\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>class Solution {\npublic:\n    int searchInsert(vector&lt;int&gt;&amp; nums, int target) {\n        int left = 0, right = nums.size() - 1, mid;\n        while(left &lt;= right) {\n            mid = (left + right) \/ 2;\n            if(nums&#91;mid] == target) {\n                return mid;\n            } else if(nums&#91;mid] &gt; target) {\n                right = mid - 1;\n            } else {\n                left = mid + 1;\n            }\n        }\n\n        if(nums&#91;mid] &lt; target) return mid + 1;\n        return mid;\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\/search-a-2d-matrix\/\">74. \u641c\u7d22\u4e8c\u7ef4\u77e9\u9635<\/a>\u2705<\/h2>\n\n\n\n<p><em><strong>\u4ee5\u7a7a\u95f4\u6362\u8111\u7ec6\u80de\uff0c\u76f4\u63a5\u628a\u77e9\u9635\u7684\u5143\u7d20\u5b58\u5165\u65b0\u6570\u7ec4\uff0c\u518d\u4e8c\u5206<\/strong><\/em><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>class Solution {\npublic:\n    bool searchMatrix(vector&lt;vector&lt;int&gt;&gt;&amp; matrix, int target) {\n        vector&lt;int&gt; nums;\n        for(auto &amp;v : matrix) {\n            for(auto &amp;num : v) {\n                nums.push_back(num);\n            }\n        }\n\n        int left = 0, right = nums.size() - 1, mid;\n        while(left &lt;= right) {\n            mid = (left + right) \/ 2;\n            if(nums&#91;mid] == target) {\n                return true;\n            } else if(nums&#91;mid] &gt; target) {\n                right = mid - 1;\n            } else {\n                left = mid + 1;\n            }\n        }\n        return false;\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-first-and-last-position-of-element-in-sorted-array\/\">34. \u5728\u6392\u5e8f\u6570\u7ec4\u4e2d\u67e5\u627e\u5143\u7d20\u7684\u7b2c\u4e00\u4e2a\u548c\u6700\u540e\u4e00\u4e2a\u4f4d\u7f6e<\/a>\u2705<\/h2>\n\n\n\n<p><strong><em>\u5982\u679c\u627e\u5230\u76ee\u6807\u503c\uff0c\u5411\u4e24\u8fb9\u6269\u6563\u627e\u5230\u8fb9\u754c\u5373\u53ef<\/em><\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>class Solution {\npublic:\n    vector&lt;int&gt; searchRange(vector&lt;int&gt;&amp; nums, int target) {\n        if(nums.empty()) return {-1, -1}; \n\n        int left = 0, right = nums.size() - 1, mid;\n        while(left &lt;= right) {\n            mid = (left + right) \/ 2;\n            if(nums&#91;mid] == target) {\n                break;\n            } else if(nums&#91;mid] &gt; target) {\n                right = mid - 1;\n            } else {\n                left = mid + 1;\n            }\n        }\n\n        if(nums&#91;mid] != target) {\n            return {-1, -1};\n        } else {\n            int lb, rb; \/\/left&amp;right border\n            if(!mid) lb = mid;\n            else {\n                for(int i = mid; i &gt;= 0; i--) {\n                    if(nums&#91;i] != target) {\n                        lb = i + 1;\n                        break;\n                    }\n                }\n            }\n\n            if(mid == nums.size() - 1) rb = nums.size() - 1;\n            else {\n                for(int i = mid; i &lt; nums.size(); i++) {\n                    if(nums&#91;i] != target) {\n                        rb = i - 1;\n                        break;\n                    }\n                }\n            }\n            return {lb, rb};\n        }\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\/search-in-rotated-sorted-array\/\">33. \u641c\u7d22\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4<\/a>\u2705<\/h2>\n\n\n\n<p><strong><em>\u4e24\u6bb5\u5206\u5f00\u4e8c\u5206\u5373\u53ef<\/em><\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>class Solution {\npublic:\n    int search(vector&lt;int&gt;&amp; nums, int target) {\n        int border = 0; \/\/\u524d\u534a\u90e8\u5206\u6709border\u4e2a\u5143\u7d20\n        bool isReverse = false;\n        for(int i = 1; i &lt; nums.size(); i++) {\n            border = i; \n            if(nums&#91;i] &lt; nums&#91;i-1]) {\n                isReverse = true;\n                break;\n            }\n        }\n        if(!isReverse) border = nums.size();\n        \/\/ cout &lt;&lt; \"border:\" &lt;&lt; border &lt;&lt; endl;\n        int left, right, mid;\n        if(target &gt;= nums&#91;0]) { \/\/\u76ee\u6807\u503c\u8981\u5728\u524d\u534a\u90e8\u5206\u627e\n            left = 0;\n            right = border - 1;\n            while(left &lt;= right) {\n                mid = (left + right) \/ 2;\n                if(nums&#91;mid] == target) {\n                    return mid;\n                } else if(nums&#91;mid] &lt; target) {\n                    left = mid + 1;\n                } else {\n                    right = mid - 1;\n                }\n            }\n        } else {\n            left = border;\n            right = nums.size() - 1;\n            while(left &lt;= right) {\n                mid = (left + right) \/ 2;\n                if(nums&#91;mid] == target) {\n                    return mid;\n                } else if(nums&#91;mid] &lt; target) {\n                    left = mid + 1;\n                } else {\n                    right = mid - 1;\n                }\n            }\n        }\n        return -1;\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-minimum-in-rotated-sorted-array\/\">153. \u5bfb\u627e\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4\u4e2d\u7684\u6700\u5c0f\u503c<\/a>\u2705<\/h2>\n\n\n\n<p><strong><em>\u4e5f\u6ca1\u7528\u5230\u4e8c\u5206\u554a \u904d\u5386\u4e00\u4e0b\u5373\u53ef<\/em><\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>class Solution {\npublic:\n    int findMin(vector&lt;int&gt;&amp; nums) {\n        for(int i = 1; i &lt; nums.size(); i++) {\n            if(nums&#91;i] &lt; nums&#91;i-1]) return nums&#91;i];\n        }\n        return nums&#91;0];\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\/median-of-two-sorted-arrays\/\">4. \u5bfb\u627e\u4e24\u4e2a\u6b63\u5e8f\u6570\u7ec4\u7684\u4e2d\u4f4d\u6570<\/a>\u2705<\/h2>\n\n\n\n<p><em><strong>\u4ee5\u7a7a\u95f4\u6362\u8111\u7ec6\u80de \u76f4\u63a5\u585e\u8fdb\u4e00\u4e2a\u6570\u7ec4 \u6392\u5e8f\u540e\u53d6\u4e2d\u95f4\u503c<\/strong><\/em><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>class Solution {\npublic:\n    double findMedianSortedArrays(vector&lt;int&gt;&amp; nums1, vector&lt;int&gt;&amp; nums2) {\n        vector&lt;int&gt; nums;\n        for(auto &amp;num : nums1) nums.push_back(num);\n        for(auto &amp;num : nums2) nums.push_back(num);\n        ranges::sort(nums);\n        \n        if(nums.size() % 2) {\n            return nums&#91;nums.size() \/ 2];\n        } else {\n            return (nums&#91;nums.size() \/ 2] + nums&#91;nums.size() \/ 2 - 1]) \/ 2.0;\n        }\n    }\n};<\/code><\/pre>\n\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>35. \u641c\u7d22\u63d2\u5165\u4f4d\u7f6e\u2705 \u4e8c\u5206\u6a21\u677f\u9898 74. \u641c\u7d22\u4e8c\u7ef4\u77e9\u9635\u2705 \u4ee5\u7a7a\u95f4\u6362\u8111\u7ec6\u80de\uff0c\u76f4\u63a5\u628a\u77e9\u9635\u7684\u5143\u7d20\u5b58\u5165\u65b0\u6570\u7ec4\uff0c\u518d\u4e8c\u5206 [&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,83,19],"class_list":["post-2487","post","type-post","status-publish","format-standard","hentry","category-suanfa","tag-leetcode","tag-83","tag-19"],"_links":{"self":[{"href":"https:\/\/guapicoding.com\/index.php?rest_route=\/wp\/v2\/posts\/2487","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=2487"}],"version-history":[{"count":9,"href":"https:\/\/guapicoding.com\/index.php?rest_route=\/wp\/v2\/posts\/2487\/revisions"}],"predecessor-version":[{"id":2500,"href":"https:\/\/guapicoding.com\/index.php?rest_route=\/wp\/v2\/posts\/2487\/revisions\/2500"}],"wp:attachment":[{"href":"https:\/\/guapicoding.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=2487"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/guapicoding.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=2487"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/guapicoding.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=2487"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}