Given an array nums
of n integers 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.
class Solution {
public:
int threeSumClosest(vector<int>& nums, int target)
{
int closet=nums[0]+nums[1]+nums[2];
int diff=abs(target-closet);
sort(nums.begin(),nums.end());
for(int i=0;i<nums.size()-2;i++)
{
int left=i+1;
int right=nums.size()-1;
while(left<right)
{
int sum=nums[i]+nums[left]+nums[right];
int newDiff=abs(sum-target);
if(diff>newDiff)
{
diff=newDiff;
closet=sum;
}
if(sum<target)
{
left++;
}
else
{
right--;
}
}
}
return closet;
}
};