[Leetcode]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).

和3Sum类似，解法也是类似的，而且省去了处理重复解~

class Solution:
    # @return an integer
    def threeSumClosest(self, num, target):
        if num is None or len(num) < 3: return None
        num.sort()
        res = None
        for i in xrange(len(num)):
            l, r = i + 1, len(num) - 1
            while l < r:
                curSum = num[i] + num[l] + num[r]
                if res is None or abs(res - target) > abs(curSum - target):
                    res = curSum
                elif curSum > target:
                    r -= 1
                else:
                    l += 1
        return res