Leetcode16-最接近的三数之和

Leetcode16-最接近的三数之和

思路：双指针

代码：

class Solution:
    def threeSumClosest(self, nums: List[int], target: int) -> int:
        nums.sort()
        min_dis = inf
        for start in range(len(nums) - 1):
            left = start + 1
            right = len(nums) - 1
            while left < right:
                three_sum = nums[start] + nums[left] + nums[right]
                if abs(three_sum - target) < min_dis:
                    min_dis = abs(three_sum - target)
                    min_sum = three_sum
                if three_sum <= target:
                    left += 1
                elif three_sum > target:
                    right -= 1
        return min_sum