https://leetcode.com/problems/3sum-closest/
class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
int Min=INT_MAX;
sort(nums.begin(), nums.end());
for(int i=0; i<nums.size(); i++){
if(i>0&&nums[i]==nums[i-1]) continue;
int k=i+1, j=nums.size()-1,sum=0;
while (k<j) {
sum = nums[i]+nums[k]+nums[j];
if(abs(sum-target)<abs(Min)) Min=sum-target;
if(sum==target) return target;
else if(sum<target) k+=1;
else j-=1;
}
}
return Min+target;
}
};