【LeetCode】16. 最接近的三数之和

题目描述（中等难度）

解题思路

python 代码

class Solution:
    def threeSumClosest(self, nums: List[int], target: int) -> int:
        nums.sort()
        # 首先考虑[1,1,1,1,1],1这种情况
        if nums[0] == nums[-1]:
            return nums[0]*3
        res = 0
        diff = float('inf')
        # [-1,2,1,-4],1
        for i in range(len(nums)):
            start = i + 1
            end = len(nums)-1
            while start < end:
                ans = nums[i] + nums[start]+ nums[end]
                if ans == target:
                	return target
                if ans > target:
                    if abs(target-ans)<diff:
                        diff = abs(target-ans)
                        res = ans
                    end -=1
                else:
                    if abs(target-ans)<diff:
                        diff = abs(target-ans)
                        res = ans
                    start += 1
        return res

if __name__ == '__main__':
    ###################
    s = Solution()
    res = s.threeSumClosest([1,1,1,0],-100)
    print(res)  # 2