【leetcode刷题】20T11-最接近的三数之和

class Solution(object):
    def threeSumClosest(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        nums.sort()
        res = sys.maxsize
        for i, n in enumerate(nums):
            j, k = i + 1, len(nums) - 1
            while j < k:
                tmp = nums[i] + nums[j] + nums[k]
                if tmp == target:
                    return target
                # 距离target更小
                if abs(tmp - target) < abs(res - target):
                    res = tmp
                if tmp > target:
                    k -= 1
                else:
                    j += 1
        return res

C++版本