Datawhale-LeetCode集训打卡-最接近的三数之和

Datawhale-LeetCode集训打卡-第六天-最接近的三数之和（3Sum Closest）

Solution

class Solution:
    def threeSumClosest(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        nums.sort()
        error = float("infinity")
        if len(nums)<3:
            return 0
        for i in range(0, len(nums)-2):
            begin = i+1
            end = len(nums)-1
            while begin<end:
                if abs(nums[i]+nums[begin]+nums[end]-target) < error:
                    error = abs(nums[i]+nums[begin]+nums[end]-target)
                    result = nums[i]+nums[begin]+nums[end]
                if nums[i]+nums[begin]+nums[end] > target:
                    end -= 1
                else:
                    begin += 1
        return result