Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly one solution.
For example, given array S = {-1 2 1 -4}, and target = 1.
The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
Subscribe to see which companies asked this question
class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
int lengh = nums.size();
int number = 999999;
int chazhi = abs(target - number);
int cha = 0;
int total = 0;
for(int i=0;i<lengh-2;i++)
{
for(int j=i+1;j<lengh-1;j++)
{
for(int k=j+1;k<lengh;k++)
{
if(i!=j && i!= k && j!= k)
{
total = nums[i] +nums[j] +nums[k];
cha = abs(total - target);
if (cha == 0)
{
return total;
}
if(cha < chazhi)
{
chazhi = cha;
number = total;
}
}
else
{
continue;
}
}
}
}
return number;
}
};