{"id":274,"date":"2022-01-15T05:31:41","date_gmt":"2022-01-14T21:31:41","guid":{"rendered":"https:\/\/www.wennroy.com\/?p=274"},"modified":"2022-01-15T05:32:53","modified_gmt":"2022-01-14T21:32:53","slug":"747-largest-number-at-least-twice-of-others","status":"publish","type":"post","link":"https:\/\/wennroy.com\/index.php\/2022\/01\/15\/747-largest-number-at-least-twice-of-others\/","title":{"rendered":"747. \u81f3\u5c11\u662f\u5176\u4ed6\u6570\u5b57\u4e24\u500d\u7684\u6700\u5927\u6570"},"content":{"rendered":"\n<p class=\"wp-block-paragraph\">\u7ed9\u4f60\u4e00\u4e2a\u6574\u6570\u6570\u7ec4 <code>nums<\/code> \uff0c\u5176\u4e2d\u603b\u662f\u5b58\u5728 <strong>\u552f\u4e00\u7684<\/strong> \u4e00\u4e2a\u6700\u5927\u6574\u6570 \u3002<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">\u8bf7\u4f60\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u6700\u5927\u5143\u7d20\u5e76\u68c0\u67e5\u5b83\u662f\u5426 <strong>\u81f3\u5c11\u662f\u6570\u7ec4\u4e2d\u6bcf\u4e2a\u5176\u4ed6\u6570\u5b57\u7684\u4e24\u500d<\/strong> \u3002\u5982\u679c\u662f\uff0c\u5219\u8fd4\u56de<strong> \u6700\u5927\u5143\u7d20\u7684\u4e0b\u6807<\/strong> \uff0c\u5426\u5219\u8fd4\u56de -1 \u3002<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">\u5341\u5206\u949f\u4ee3\u7801\u5982\u4e0b\uff1a<\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">class Solution:\n    def dominantIndex(self, nums: List[int]) -> int:\n        if (n := len(nums)) == 1:\n            return 0\n        max_index = 0\n        first = 0\n        second = 0\n        for i in range(n):\n            if nums[i] > first:\n                second = first\n                first = nums[i]\n                max_index = i\n            elif nums[i] > second:\n                second = nums[i]\n        return (max_index if first >= 2*second else -1)<\/pre>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>\u6267\u884c\u7528\u65f6\uff1a<\/strong>36 ms, \u5728\u6240\u6709\u00a0Python3\u00a0\u63d0\u4ea4\u4e2d\u51fb\u8d25\u4e8641.43%\u7684\u7528\u6237<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>\u5185\u5b58\u6d88\u8017\uff1a<\/strong>15 MB, \u5728\u6240\u6709\u00a0Python3\u00a0\u63d0\u4ea4\u4e2d\u51fb\u8d25\u4e8629.92%\u7684\u7528\u6237<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">\u53ea\u80fd\u8bf4\u51e0\u4e4e\u548c\u5b98\u65b9\u5199\u5f97\u4e00\u6a21\u4e00\u6837\uff0c<strong>\u5b98\u65b9\u6807\u7b54\uff1a<\/strong><\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">class Solution:\n    def dominantIndex(self, nums: List[int]) -> int:\n        m1, m2, idx = -1, -1, 0\n        for i, num in enumerate(nums):\n            if num > m1:\n                m1, m2, idx = num, m1, i\n            elif num > m2:\n                m2 = num\n        return idx if m1 >= m2 * 2 else -1<\/pre>\n\n\n\n<p class=\"wp-block-paragraph\">\u6765\u6e90\uff1a\u529b\u6263\uff08LeetCode\uff09<br>\u94fe\u63a5\uff1a<a href=\"https:\/\/leetcode-cn.com\/problems\/largest-number-at-least-twice-of-others\">https:\/\/leetcode-cn.com\/problems\/largest-number-at-least-twice-of-others<\/a><br>\u8457\u4f5c\u6743\u5f52\u9886\u6263\u7f51\u7edc\u6240\u6709\u3002\u5546\u4e1a\u8f6c\u8f7d\u8bf7\u8054\u7cfb\u5b98\u65b9\u6388\u6743\uff0c\u975e\u5546\u4e1a\u8f6c\u8f7d\u8bf7\u6ce8\u660e\u51fa\u5904\u3002<\/p>\n","protected":false},"excerpt":{"rendered":"<p>\u7ed9\u4f60\u4e00\u4e2a\u6574\u6570\u6570\u7ec4 nums \uff0c\u5176\u4e2d\u603b\u662f\u5b58\u5728 \u552f\u4e00\u7684 &hellip;<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_import_markdown_pro_load_document_selector":0,"_import_markdown_pro_submit_text_textarea":"","footnotes":""},"categories":[6,18],"tags":[25,15],"class_list":["post-274","post","type-post","status-publish","format-standard","hentry","category-leetcode","category-ergodic","tag-leetcode","tag-15"],"_links":{"self":[{"href":"https:\/\/wennroy.com\/index.php\/wp-json\/wp\/v2\/posts\/274","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/wennroy.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/wennroy.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/wennroy.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/wennroy.com\/index.php\/wp-json\/wp\/v2\/comments?post=274"}],"version-history":[{"count":2,"href":"https:\/\/wennroy.com\/index.php\/wp-json\/wp\/v2\/posts\/274\/revisions"}],"predecessor-version":[{"id":276,"href":"https:\/\/wennroy.com\/index.php\/wp-json\/wp\/v2\/posts\/274\/revisions\/276"}],"wp:attachment":[{"href":"https:\/\/wennroy.com\/index.php\/wp-json\/wp\/v2\/media?parent=274"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/wennroy.com\/index.php\/wp-json\/wp\/v2\/categories?post=274"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/wennroy.com\/index.php\/wp-json\/wp\/v2\/tags?post=274"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}