class Solution {
public:
int threeSumClosest(vector<int> &num, int target) {
sort(num.begin(),num.end());
int n = num.size();
int cl = num[0]+num[1]+num.back();
int sum;
for(int i=0;i<n-2;++i){
int j=i+1;
int k=n-1;
while(j<k){
sum = num[i]+num[j]+num[k];
if(abs(sum-target)<abs(cl-target)) cl=sum;
if(sum==target) return target;
if(sum<target)
{
++j;
}
else
{
--k;
}
}
}
return cl;
}
};
3Sum Closest
最新推荐文章于 2020-09-08 11:56:16 发布