class Solution:
    def threeSumClosest(self, nums: List[int], target: int) -> int:
        minCom = abs(nums[0] + nums[1] + nums[2] - target)
        result = nums[0] + nums[1] + nums[2]
        for i in range(len(nums)-2):
            for j in range(i+1,len(nums)-1):
                for k in range(j+1,len(nums)):
                    if abs(nums[i]+nums[j]+nums[k]-target) <minCom:
                        minCom = abs(nums[i]+nums[j]+nums[k]-target)
                        result = nums[i]+nums[j]+nums[k]
                        if minCom == 0:
                            return result
        return result

class Solution:
    def threeSumClosest(self, nums: List[int], target: int) -> int:
        nums.sort()
        result = nums[0] + nums[1] + nums[2]                
        for i in range(len(nums)-2):
            L = i+1
            R = len(nums)-1
            while L<R:
                threeNumSum = nums[i] + nums[L] + nums[R]
                if abs(threeNumSum-target) < abs(result-target):
                    result = threeNumSum
                if threeNumSum > target:
                    R -= 1
                elif threeNumSum < target:
                    L +=1
                else:
                    return target
        return result