cpp-codes/Array_Leetcode_3Sum_Closest_16.cpp at master · abhinavkumaryadav1/cpp-codes · 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
56
57
58
59
60
61
62
63
64
65
66
/*16. 3Sum Closest
Given an integer array nums of length n and an integer target, find three integers 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 <= */

class Solution {
public:
    int threeSumClosest(vector<int>& nums, int target) {

        int n = nums.size();
        int mini = INT_MAX;

      sort(nums.begin(),nums.end());
      int ans;
      for(int i=0;i<n-2;i++)
      {
       int k=n-1;
       int j=i+1;

       while(j<k)
       {
        int sum=nums[i]+nums[j]+nums[k];

        int val = abs(target-sum);
            if(val<mini)
            {
            ans=sum;
            mini = val;
            }

        if(sum>target)
        {
          k--;
        }

        else
        {
          j++;
        }

       }

      }
return ans;
    }
};