目录
题目描述:
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).
算法描述:
该问题和前一个3Sum的问题即为类似,方法和其类似,首先对数列进行排序,选取一个数字后,在剩余数组中利用两个指针(左右指针,开始时左指针指向开头,右指针指向结尾)向中间移动扫描构成三个数字,若当前三个数字之和大于target则右指针左移;若小于target则左指针右移;而若恰好其和为target,则直接返回target
算法实现:
class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
int now_sum;
int res;
int gap = INT_MAX;
if(nums.size() < 3) return INT_MIN;
sort(nums.begin(),nums.end());
for(int i = 0; i < nums.size() - 2; )
{
for(int j = i + 1, k = nums.size() - 1; j < k; ){
now_sum = nums[i] + nums[j] + nums[k];
if(gap > abs(now_sum - target))
{
res = now_sum;
gap = abs(now_sum - target);
}
//下面两行代码是不可以添加的,这个问题不同于第15题,当前左侧重复的值,可能是下一个k-1对应的值;反之亦然
// while(j < k && nums[j + 1] == nums[j])j++;
// while(j < k && nums[k - 1] == nums[k])k--;
if(now_sum > target)k --;
else if(now_sum < target)j ++;
else return target;
}
while(i < nums.size() - 2 && nums[i + 1] == nums[i])i ++;
i ++;
}
return res;
}
};