{"id":295,"date":"2020-09-26T10:17:29","date_gmt":"2020-09-26T02:17:29","guid":{"rendered":"http:\/\/39.96.58.60\/?p=295"},"modified":"2022-10-18T16:43:56","modified_gmt":"2022-10-18T08:43:56","slug":"leetcode-16-%e6%9c%80%e6%8e%a5%e8%bf%91%e7%9a%84%e4%b8%89%e6%95%b0%e4%b9%8b%e5%92%8c","status":"publish","type":"post","link":"https:\/\/www.yatenglg.cn\/blog\/?p=295","title":{"rendered":"Leetcode 16. \u6700\u63a5\u8fd1\u7684\u4e09\u6570\u4e4b\u548c"},"content":{"rendered":"

\u7ed9\u5b9a\u4e00\u4e2a\u5305\u62ec n<\/em> \u4e2a\u6574\u6570\u7684\u6570\u7ec4 nums<\/code> <\/em>\u548c \u4e00\u4e2a\u76ee\u6807\u503c target<\/code>\u3002\u627e\u51fa nums<\/code> <\/em>\u4e2d\u7684\u4e09\u4e2a\u6574\u6570\uff0c\u4f7f\u5f97\u5b83\u4eec\u7684\u548c\u4e0e target<\/code> \u6700\u63a5\u8fd1\u3002\u8fd4\u56de\u8fd9\u4e09\u4e2a\u6570\u7684\u548c\u3002\u5047\u5b9a\u6bcf\u7ec4\u8f93\u5165\u53ea\u5b58\u5728\u552f\u4e00\u7b54\u6848\u3002<\/p>\n

 <\/p>\n

\u793a\u4f8b\uff1a<\/strong><\/p>\n

\u8f93\u5165\uff1a<\/strong>nums = [-1,2,1,-4], target = 1\n\n\u8f93\u51fa\uff1a<\/strong>2\n\n\u89e3\u91ca\uff1a<\/strong>\u4e0e target \u6700\u63a5\u8fd1\u7684\u548c\u662f 2 (-1 + 2 + 1 = 2) \u3002\n\n<\/pre>\n
 <\/p>\n
\u63d0\u793a\uff1a<\/strong><\/p>\n
    \n
  • 3 <= nums.length <= 10^3<\/code><\/li>\n
  • -10^3 <= nums[i] <= 10^3<\/code><\/li>\n
  • -10^4 <= target <= 10^4<\/code><\/li>\n<\/ul>\n
    **\u96be\u5ea6**: Medium<\/p>\n
    **\u6807\u7b7e**: \u6570\u7ec4\u3001 \u53cc\u6307\u9488\u3001<\/p>\n
    \n
    \n# -*- coding: utf-8 -*-\n# @Author  : LG\n\n\"\"\"\n\u6267\u884c\u7528\u65f6\uff1a132 ms, \u5728\u6240\u6709 Python3 \u63d0\u4ea4\u4e2d\u51fb\u8d25\u4e8651.24% \u7684\u7528\u6237\n\u5185\u5b58\u6d88\u8017\uff1a13.5 MB, \u5728\u6240\u6709 Python3 \u63d0\u4ea4\u4e2d\u51fb\u8d25\u4e8691.44% \u7684\u7528\u6237\n\n\u89e3\u9898\u601d\u8def\uff1a\n    \u53cc\u6307\u9488\u6cd5\n\"\"\"\nclass Solution:\n    def threeSumClosest(self, nums: List[int], target: int) -> int:\n        nums.sort()\n        result = sum(nums[:3])\n        n = len(nums)\n        now = None\n        for i in range(n):\n            if nums[i] == now:  # \u9047\u5230\u91cd\u590d\u7684\u503c\uff0c\u8df3\u8fc7\n                continue\n            now = nums[i]\n\n            l, r = i+1, n-1 # \u5de6\u53f3\u6307\u9488\n            while l < r:  # \u5de6\u6307\u9488\u5c0f\u4e8e\u53f3\u6307\u9488\uff0c\u5faa\u73af\n                sum_ = nums[i] + nums[l] + nums[r]\n                if sum_ == target:    # \u548c\u4e3a0\n                    return target\n                if abs(target - sum_) < abs(target - result):\n                    result = sum_\n                elif sum_ < target:     # \u548c < target\uff0c \u5de6\u6307\u9488\u53f3\u79fb\n                    l += 1\n                else:   # \u548c > target\uff0c \u53f3\u6307\u9488\u5de6\u79fb\n                    r -= 1\n        return result\n\n\"\"\"\n\u6267\u884c\u7528\u65f6\uff1a48 ms, \u5728\u6240\u6709 Python3 \u63d0\u4ea4\u4e2d\u51fb\u8d25\u4e8698.70% \u7684\u7528\u6237\n\u5185\u5b58\u6d88\u8017\uff1a13.7 MB, \u5728\u6240\u6709 Python3 \u63d0\u4ea4\u4e2d\u51fb\u8d25\u4e8650.46% \u7684\u7528\u6237\n\n\u89e3\u9898\u601d\u8def\uff1a\n    \n\"\"\"\n\nclass Solution:\n    def threeSumClosest(self, nums: List[int], target: int) -> int:\n        nums.sort()\n        result = sum(nums[:3])\n        n = len(nums)\n        now = None\n        for i in range(n-2):\n            if nums[i] == now:\n                continue\n            now = nums[i]\n\n            l, r = i+1, n-1\n            if nums[i]+nums[r-1]+nums[r] <= target:     # \u5224\u65ad\u5f53\u524d\u503c\u4e0e\u6700\u5927\u7684\u4fe9\u4e2a\u503c\u7684\u548c    ### \u4f18\u5316\n                l = r-1\n            elif nums[i]+nums[l]+nums[l+1] >= target:   # \u5224\u65ad\u5f53\u524d\u503c\u4e0e\u6700\u5c0f\u7684\u4fe9\u4e2a\u503c\u7684\u548c    ### \u4f18\u5316\n                r = l+1\n            while l < r:\n                sum_ = nums[i]+nums[l]+nums[r]\n\n                if sum_ == target:    # \u548c\u4e3a0\n                    return target\n                if abs(target - sum_) < abs(target - result):\n                    result = sum_\n                elif sum_ < target:     # \u548c < target\uff0c \u5de6\u6307\u9488\u53f3\u79fb\n                    l += 1\n                else:   # \u548c > target\uff0c \u53f3\u6307\u9488\u5de6\u79fb\n                    r -= 1\n        return result<\/code><\/pre>\n<\/div>\n","protected":false},"excerpt":{"rendered":"
    \u7ed9\u5b9a\u4e00\u4e2a\u5305\u62ec n \u4e2a\u6574\u6570\u7684\u6570\u7ec4 nums \u548c \u4e00\u4e2a\u76ee\u6807\u503c target…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":[],"categories":[11,1],"tags":[],"_links":{"self":[{"href":"https:\/\/www.yatenglg.cn\/blog\/index.php?rest_route=\/wp\/v2\/posts\/295"}],"collection":[{"href":"https:\/\/www.yatenglg.cn\/blog\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.yatenglg.cn\/blog\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.yatenglg.cn\/blog\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.yatenglg.cn\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=295"}],"version-history":[{"count":1,"href":"https:\/\/www.yatenglg.cn\/blog\/index.php?rest_route=\/wp\/v2\/posts\/295\/revisions"}],"predecessor-version":[{"id":296,"href":"https:\/\/www.yatenglg.cn\/blog\/index.php?rest_route=\/wp\/v2\/posts\/295\/revisions\/296"}],"wp:attachment":[{"href":"https:\/\/www.yatenglg.cn\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=295"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.yatenglg.cn\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=295"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.yatenglg.cn\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=295"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}