[leetcode: Python]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).

找出数组中最接近给定值的三个数的和。

方法一：129ms

class Solution(object):
    def threeSumClosest(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        nums.sort()
        mindiff = pow(2,30)
        for i in range(len(nums)):
            left = i + 1
            right = len(nums) - 1
            while left < right:
                sum = nums[i] + nums[left] + nums[right]
                diff = abs(target - sum)
                if diff < mindiff:
                    mindiff = diff
                    res = sum
                if sum == target:
                    return sum
                elif sum < target:
                    left += 1
                else:
                    right -= 1
        return res

方法二：52ms
考虑到target的正负，利用nums排序后，减少比较数！！很好啊

class Solution(object):
    def threeSumClosest(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        nums.sort()
        if target <= 0:
            out = abs(sum(nums[:3])-target)
            out_sum = sum(nums[:3])
            n=len(nums)
            for i in xrange(n):
                j,k=i+1,n-1
                while j<k:
                    isum=nums[i]+nums[j]+nums[k]
                    if abs(isum-target) < out:
                        out = abs(isum-target)
                        out_sum = isum
                    if isum > target:
                        k-=1
                    elif isum < target:
                        j+=1
                    elif isum==target:
                        return isum
                if nums[i]>0:
                    return out_sum
            return out_sum
        if target > 0:
            nums = nums[::-1]
            out = abs(sum(nums[:3])-target)
            out_sum = sum(nums[:3])
            n=len(nums)
            for i in xrange(n):
                j,k=i+1,n-1
                while j<k:
                    isum=nums[i]+nums[j]+nums[k]
                    if abs(isum-target) < out:
                        out = abs(isum-target)
                        out_sum = isum
                    if isum < target:
                        k-=1
                    elif isum > target:
                        j+=1
                    elif isum==target:
                        return isum
                if nums[i]<0:
                    return out_sum
            return out_sum
############# TLE
#        out = abs(sum(nums[:3])-target)
#        out_sum = sum(nums[:3])
#        n=len(nums)
#        #print 'sum:', out
#        for i in xrange(n):
#            for j in xrange(i+1,n):
#                for k in xrange(j+1,n):
#                    isum=nums[i]+nums[j]+nums[k]
#                    #print '%s+%s+%s-(%s)=%s'%(nums[i],nums[j], nums[k],target, isum)
#                    if abs(isum-target) < out:
#                        #print 'smaller:',abs(isum-target)
#                        out = abs(isum-target)
#                        out_sum = isum
#        return out_sum