class Solution(object):
    def threeSumClosest(self, nums, target):
        nums.sort()
        pre_sum = None
        for i in xrange(len(nums) - 2):
            head, tail = i+1, len(nums)-1
            while head < tail:
                sum = nums[i] + nums[head] + nums[tail]
                if pre_sum == None:
                    pre_sum = sum
                if abs(sum - target) < abs(pre_sum - target):
                    pre_sum = sum

                if sum < target:
                    head += 1
                elif sum > target:
                    tail -= 1
                else:
                    return target
        return pre_sum

优质内容筛选与推荐>>
1、★宣传广告变成社会标准
2、【c++ primer读书笔记】【第7章】类
3、maven排除jar包冲突
4、随意组合 dfs
5、加载ralink固件rt73.bin