LeetCode-Solution/LeetCode16.cpp at main · nfpranta/LeetCode-Solution · 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
class Solution
{
public:
    int threeSumClosest(vector<int>& nums, int target)
    {
        sort(nums.begin(),nums.end());
        int n=nums.size();
        int ans=10000;
        int mn=ans;
        for(int i=0; i<n-1; i++)
        {
            int left=i+1;
            int right=n-1;
            while(left<right)
            {
                int sum=nums[i]+nums[left]+nums[right];
                if(sum==target)
                {
                    return sum;
                }
                else if(sum<target)
                {
                    left++;
                }
                else right--;
                if(abs(sum-target)<mn)
                {
                    ans=sum;
                    mn=abs(sum-target);
                }
            }
        }
        return ans;
    }
};