16. 3Sum Closest
Medium
96078FavoriteShare
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.
Example:
Given array nums = [-1, 2, 1, -4], and target = 1. The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
这道题是看了答案,自己写的,不多说了。
class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
sort(nums.begin(),nums.end());
int sum=0;
int diff=0x7fffffff;
for(int i=0;i<nums.size()-1;i++)
{
int j=i+1;
int k=nums.size()-1;
while(j<k)
{
int tempsum=nums[i]+nums[j]+nums[k];
int tempdiff=abs(tempsum-target);
if(tempdiff<diff)
{
diff=tempdiff;
sum=tempsum;
}
if(tempsum>target)k--;
else if(tempsum<target)j++;
else return sum;
}
}
return sum;
}
};