题目:
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).
思路:
1.题目与上题(3Sum)类似,算法框架也类似,只是本题是求最接近的数;
2.接近无非就是要使|a+b+c-target|最小,那么先对数组排序;
3.接近的话要考虑当前a+b+c-target的正负,需要分别求出负最大值和正最小值,最后比较这两个值,获得结果;
4.与3Sum类似,令第一个数i开始遍历数组,令j=i+1,令k=nums.size()-1,若当前差小于0,则j++,直到找到当前最大负数,若当前差大于0,则令k--,直到找到当前i下最小正数;
5.算法思路较简单,可直接看代码。
代码:
<span style="font-size:14px;font-weight: normal;">class Solution{
public:
int threeSumClosest(vector<int> &num,int target){
int result=0;int l=-INT_MAX;int r=INT_MAX;
sort(num.begin(),num.end());
for(int i=0;i!=num.size();++i)
{
int j=i+1,k=num.size()-1;
while(j<k)
{
result=num[i]+num[j]+num[k]-target;
if(result==0)
return target;
else if (result<0)
{
while(j<k && num[i]+num[j+1]+num[k]-target<=0)
{
++j;
}
if(j!=k)
{
l=(l<num[i]+num[j]+num[k]-target)?(num[i]+num[j]+num[k]-target):l;
++j;
}
else //有可能遍历结束差仍小0,那么此时j==k
l=(l<num[i]+num[j-1]+num[k]-target)?(num[i]+num[j-1]+num[k]-target):l;
}
else
{
while(k>j && num[i]+num[j]+num[k-1]-target>=0)
{
--k;
}
if(j!=k)
{
r=(r<num[i]+num[j]+num[k]-target)?r:(num[i]+num[j]+num[k]-target);
--k;
}
else //有可能遍历结束差仍大0
r=(r<num[i]+num[j]+num[k+1]-target)?r:(num[i]+num[j]+num[k+1]-target);
}
}
}
return (-l<r)?(l+target):(r+target);
}
};</span></span>
<span style="font-size:14px;font-weight: normal;">class Solution{
public:
int threeSumClosest(vector<int> &num,int target){
int result=0;int l=-INT_MAX;int r=INT_MAX;
sort(num.begin(),num.end());
for(int i=0;i!=num.size();++i)
{
int j=i+1,k=num.size()-1;
while(j<k)
{
result=num[i]+num[j]+num[k]-target;
if(result==0)
return target;
else if (result<0)
{
while(j<k && num[i]+num[j+1]+num[k]-target<=0)
{
++j;
}
if(j!=k)
{
l=(l<num[i]+num[j]+num[k]-target)?(num[i]+num[j]+num[k]-target):l;
++j;
}
else //有可能遍历结束差仍小0,那么此时j==k
l=(l<num[i]+num[j-1]+num[k]-target)?(num[i]+num[j-1]+num[k]-target):l;
}
else
{
while(k>j && num[i]+num[j]+num[k-1]-target>=0)
{
--k;
}
if(j!=k)
{
r=(r<num[i]+num[j]+num[k]-target)?r:(num[i]+num[j]+num[k]-target);
--k;
}
else //有可能遍历结束差仍大0
r=(r<num[i]+num[j]+num[k+1]-target)?r:(num[i]+num[j]+num[k+1]-target);
}
}
}
return (-l<r)?(l+target):(r+target);
}
};</span></span>