LeetCode 16：最接近的三数之和（3Sum Closest）

英文题目

Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution.

Example:

Given array nums = [-1, 2, 1, -4], and target = 1.

The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

中文题目

给定一个包括 n 个整数的数组 nums 和 一个目标值 target。找出 nums 中的三个整数，使得它们的和与 target 最接近。返回这三个数的和。假定每组输入只存在唯一答案。

示例：

给定数组 nums = [-1，2，1，-4], 和 target = 1.

与 target 最接近的三个数的和为 2. (-1 + 2 + 1 = 2).

解答

Python

class Solution:
    def threeSumClosest(self, nums: 'List[int]', target: int) -> int:
        n = len(nums)
        nums.sort()
        min_sum = sum(nums[0:3])
        for i in range(n):
            if i > 0 and nums[i] == nums[i-1]: # 判断固定的数是否重复
                continue
            left = i + 1
            right = n - 1
            while left < right:
                cur = nums[i] + nums[left] + nums[right]
                if abs(target - cur) < abs(target - min_sum):
                    min_sum = cur

                if cur > target:
                    right -= 1
                elif cur < target:
                    left += 1
                else:
                    return target

        return min_sum