题目:
给定一个包括 n 个整数的数组 nums 和 一个目标值 target。
找出 nums 中的三个整数,使得它们的和与 target 最接近。
返回这三个数的和。假定每组输入只存在唯一答案。
示例:
例如,给定数组 nums = [-1,2,1,-4], 和 target = 1.
与 target 最接近的三个数的和为 2. (-1 + 2 + 1 = 2).
代码如下:
class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
int n = nums.size();
if (n == 3)
{
int sum = 0;
for (int k = 0; k < nums.size(); k++)
{
sum += nums[k];
}
return sum;
}
int minDiff = INT_MAX;
int closestSum = 0;
sort(nums.begin(), nums.end());
for (int i = 0; i < nums.size() - 2; i++)
{
if (i > 1 && nums[i] == nums[i - 1])
{
continue;
}
int L = i + 1;
int R = n - 1;
while (L < R)
{
int threeSum = nums[i] + nums[L] + nums[R];
int diff = threeSum - target;
if (abs(diff) < minDiff)
{
minDiff = abs(diff);
closestSum = threeSum;
}
if (diff == 0)
{
return closestSum;
}
else if (diff < 0)
{
L++;
while (L < R && nums[L] == nums[L - 1])
{
L++;
}
}
else
{
R--;
while (L < R && nums[R] == nums[R + 1])
{
R--;
}
}
}
}
return closestSum;
}
};