LeetCode 最接近的三数之和 Python

• 直接贴代码好了，Python真的没的说

class Solution(object):
    def threeSumClosest(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        nums.sort()
        res = nums[0]+nums[1]+nums[2]
        re_min = res - target
        for k in range(len(nums)-2):
            if k>0 and nums[k]==nums[k-1]:
                continue
            i = k+1
            j = len(nums)-1
            while i<j:
                x = nums[k]+nums[i]+nums[j]
                s = x - target
                if abs(s)<abs(re_min):
                    re_min = s
                    res = x
                if s==0:
                    return target
                elif s<0:
                    i += 1
                    while i<j and nums[i]==nums[i-1]:
                        i += 1
                else:
                    j -= 1
                    while i<j and nums[j]==nums[j+1]:
                        j -= 1
        return res