Description

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

Code

class Solution(object):
    def threeSumClosest(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        res, resCnt = sys.maxint, sys.maxint
        nums.sort()
        for
 
 i in xrange(len(nums) - 2):
            if i > 0 and nums[i] == nums[i - 1]:
                continue
            l, r = i + 1, len(nums) - 1
            while l < r:
                s = nums[i] + nums[l] + nums[r]
                cnt = abs(target - s)
                if cnt == 0:
                    return
 
 s
                if s < target:
                    l += 1
                else:
                    r -= 1
                if cnt < resCnt:
                    res, resCnt = s, cnt
        return res

Conclusion

這道題完全是照著3sum改來的，沒想到beat 94%了，哈哈哈哈。當初那題只beat 了33%，估計這次是系統超長髮揮，給我快速運算完了。不過，又提交了一次，還是90%以上，哈哈哈。可以。