LeetCode/16_3Sum_Closest.py at main · AnmolPatel20/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
"""
Given an integer array nums of length n and an integer target, find three integers at distinct indices in nums such that the sum is closest to target.

Return the sum of the three integers.

You may assume that each input would have exactly one solution.


Example 1:

Input: nums = [-1,2,1,-4], target = 1
Output: 2
Explanation: The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
Example 2:

Input: nums = [0,0,0], target = 1
Output: 0
Explanation: The sum that is closest to the target is 0. (0 + 0 + 0 = 0).


Constraints:

3 <= nums.length <= 500
-1000 <= nums[i] <= 1000
-104 <= target <= 104


"""
class Solution:
    def threeSumClosest(self, nums: List[int], target: int) -> int:
        nums.sort()
        resultSum = nums[0] + nums[1] + nums[2]
        minDiff = float(inf)

        for i in range(len(nums)-2):
            left = i + 1
            right = len(nums) - 1

            while(left < right):
                sum = nums[i] + nums[left] + nums[right]

                if sum == target:
                    return target
                elif sum < target:
                    left+=1
                else:
                    right-=1

                diffToTarget = abs(sum-target)
                if diffToTarget < minDiff :
                    resultSum = sum
                    minDiff = diffToTarget

        return resultSum