programming-practice/array/medium/3SumClosest.py at master · sindhura-pv/programming-practice · 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
class Solution:
    def threeSumClosest(self, nums: List[int], tar: int) -> int:

        if not nums:
            return []

        diff = float('inf')
        s = 0
        nums.sort()

        for i in range(len(nums)-2):
            a = i
            b = i+1
            c = len(nums)-1

            while b<c:
                if nums[a]+ nums[b]+ nums[c] < tar:
                    if abs(tar- (nums[a]+ nums[b]+ nums[c])) < diff:
                        diff = abs(tar- (nums[a]+ nums[b]+ nums[c]))
                        s = nums[a]+ nums[b]+ nums[c]
                    b += 1

                elif nums[a]+ nums[b]+ nums[c] > tar:
                    if abs(tar- (nums[a]+ nums[b]+ nums[c])) < diff:
                        diff = abs(tar- (nums[a]+ nums[b]+ nums[c]))
                        s = nums[a]+ nums[b]+ nums[c]
                    c -= 1

                else:
                    return tar

        return s