16. 3Sum Closest(Python3)

16. 3Sum Closest(Python3)

题目

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).

解题方案

代码：

class Solution:
    def threeSumClosest(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        nums.sort()
        count = len(nums)
        distance = None
        res = None
        for i in range(0,count):
            head = i+1
            tail = count-1
            while head < tail: 
                val = nums[i]+nums[head]+nums[tail]
                if distance == None or abs(val-target) < distance:
                    distance = abs(val-target)
                    res = val

                if val == target:
                    return res
                elif val < target:
                    head +=1
                else:
                    tail -= 1
        return res