题目描述
给定一个包括 n 个整数的数组 nums 和 一个目标值 target。找出 nums 中的三个整数,使得它们的和与 target 最接近。返回这三个数的和。假定每组输入只存在唯一答案。
例如,给定数组 nums = [-1,2,1,-4], 和 target = 1.
与 target 最接近的三个数的和为 2. (-1 + 2 + 1 = 2).
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/3sum-closest
思路
类似15. 3Sum,先对数组进行排序,外层循环就是遍历一遍数组,内层循环就是用两个指针low和high,与3sum不同的就是
每次循环要判断记录当前sum和target的差值。
时间复杂度O(n^2)
C++
class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
int len = nums.size();
long long res=nums[0] + nums[1] + nums[2], min_gap, sum, curr_gap; // 防止溢出所以用long long型
min_gap = abs(res - target);
sort(nums.begin(), nums.end());
for(int i = 0; i < len - 2; i++){
int low = i + 1, high = len - 1;
while(low < high){
sum = nums[i] + nums[low] + nums[high];
curr_gap = abs(sum - target);
if(curr_gap < min_gap){
res = sum;
min_gap = curr_gap;
}
if(target < sum) high--;
else if(target > sum) low++;
else return target;
} // low == high
}
return res;
}
};
class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
int result = 0;
int minGap = INT_MAX;
sort(nums.begin(), nums.end());
for(auto a = nums.begin(); a != prev(nums.end(), 2); ++ a){
auto b = next(a);
auto c = prev(nums.end());
while(b < c){
const int sum = *a + *b + *c;
const int currGap = abs(sum - target);
if(currGap < minGap){
minGap = currGap;
result = sum;
}
if(sum > target){
-- c;
}else{
++ b;
}
}
}
return result;
}
};