1. 题目描述
给你一个长度为 n 的整数数组 nums 和 一个目标值 target。请你从 nums 中选出三个整数,使它们的和与 target 最接近。
返回这三个数的和。
假定每组输入只存在恰好一个解。
示例 1:
输入:nums = [-1,2,1,-4], target = 1
输出:2
解释:与 target 最接近的和是 2 (-1 + 2 + 1 = 2) 。
示例 2:
输入:nums = [0,0,0], target = 1
输出:0
提示:
3 <= nums.length <= 1000
-1000 <= nums[i] <= 1000
-104 <= target <= 104
2.代码如下
1.c++
class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
const int size = (int)nums.size();
int mostequal = nums[0] + nums[1] + nums[2];
int diff = abs(mostequal - target);
sort(nums.begin(),nums.end());
for (int i = 0; i < size -2;++i)
{
int head = i+1;
int tail = size-1;
while (head < tail)
{
int tmp = nums[i] + nums[head] + nums[tail];
int tmpdiff = abs(target - tmp);
if (diff > tmpdiff)
{
diff = tmpdiff;
mostequal = tmp;
}
if (tmp < target)
{
++head;
}
else
{
--tail;
}
}
}
return mostequal;
}
};