leetcode16

import sys
class Solution:
    def threeSumClosest(self, nums: 'List[int]', target: int) -> int:
        n = len(nums)
        if n <= 3:
            return sum(nums)
        nums = sorted(nums)
        mindiff = sys.maxsize
        minsums = 0
        for i in range(n-2):
            j,k = i + 1,n - 1
            while j < k:
                sums = nums[i] + nums[j] + nums[k]
                diff = sums - target
                if diff == 0:
                    return target
                elif diff < 0:
                    j += 1
                else:
                    k -= 1
                if abs(diff) < mindiff:
                    mindiff = abs(diff)
                    minsums = sums
        return minsums