【LeetCode】16. 3Sum Closest

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

    For example, given array S = {-1 2 1 -4}, and target = 1.

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

题意：给出一个数组和一个目标值，在数组中找出和目标值最接近的三个值的和

思路：和LeetCode:15. 3Sum一样，先找出一个值，然后用其余的两个指针不断的找出距离目标插值最小的两个值，每次找出时候刷新三个数的和

class Solution(object):
    def threeSumClosest(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        nums.sort()
        l = len(nums)
        i = 0
        min=9999999999
        while i<l-2:
            begin=i+1;end=l-1
            tmp=nums[begin]+nums[end]
            cool = target-nums[i]
            while begin<end:
                if abs(tmp-cool)<min:
                    min=abs(tmp-cool)
                    sum=nums[begin]+nums[end]+nums[i]
                if cool<tmp:
                    end-=1
                elif cool>tmp:
                    begin+=1
                else:
                    return target
                tmp=nums[begin]+nums[end]
            i+=1
        return sum

ps:我还能说什么，晚上不适合做题。。。智商不足