LEETCODE 16. 最接近的三数之和

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