题目:
16. 3Sum Closest
Medium
75858
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 minsum = nums[0] + nums[1] + nums[nums.size()-1];
for(int i = 0; i<nums.size(); i++)
{
if( i == 0 || (i>0 && nums[i] != nums[i-1]))
{
int low = i + 1, high = nums.size() - 1;
while(low < high)
{
int sum = nums[i] + nums[low] + nums[high];
if(sum == target)
{
low++;high--;
}
else if(sum < target)
low++;
else
high--;
if(abs(sum - target) < abs(minsum - target))
{
minsum = sum;
}
}
}
}
return minsum;
}
};