16. 最接近的三数之和

最新推荐文章于 2024-10-16 10:13:45 发布

longying1999

最新推荐文章于 2024-10-16 10:13:45 发布

阅读量38

点赞数

分类专栏： Leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/longying1999/article/details/129498937

版权

Leetcode 专栏收录该内容

56 篇文章 0 订阅

订阅专栏

题目描述

方法：

排序+双指针

class Solution:
    def threeSumClosest(self, nums: List[int], target: int) -> int:
        nums.sort()
        d = inf
        res = 0
        for k in range(len(nums)):
            i,j = k+1,len(nums)-1
            while i < j:
                s = nums[i] + nums[j] + nums[k]
                diff = s - target
                if abs(diff) < d:
                    res = s
                    d = abs(diff)
                if diff > 0:
                    j -= 1
                elif diff < 0:
                    i += 1
                else:
                    return target
        return res