3Sum Closest LeetCode solution in Python

1
# Runtime: 1535 ms (Top 7.9%) | Memory: 16.58 MB (Top 11.9%)
2

3

4
class Solution:
5
    def threeSumClosest(self, nums: List[int], target: int) -> int:
6
        closet = float("inf")
7
        nums.sort()
8
        for i in range(len(nums) - 2):
9
            l, r = i + 1, len(nums) - 1
10
            while l < r:
11
                sum3 = nums[i] + nums[l] + nums[r]
12
                print(sum3)
13
                if sum3 < target:
14
                    l += 1
15
                else:
16
                    r -= 1
17
                if abs(sum3 - target) < abs(closet - target):
18
                    closet = sum3
19
        return closet