Today's Challenge

https://leetcode.com/problems/3sum-closest/

3Sum Closest - LeetCode

6번 WA 받고 그냥 솔루션 봄 -_-
조건이 좀 까다로운 것 같았는데.. sliding window를 이용하면 되는 거 였던듯.

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