这道题又是上一题3Sum的变形,3Sum是求出所有三个数相加和为0的情况,这个题是求出是三个数的和最接近target的情况,返回这个和。
我的思路还是用了3Sum的方法,遍历数组加2Sum二分查找。但是有些地方没注意,也调了好久。一个是如果2Sum直接等于target-nums[i],说明找到了三个数的和正好等于target,这个时候函数可以直接返回target,不用继续了,因为不可能有更好的方案了。再一个就是,我设了一个diff用来看什么时候更新res,这个diff必须用绝对值来更新,也就是abs那里,一开始忘了加。
class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
sort(nums.begin(), nums.end());
int diff = INT_MAX;
int res = 0;
for(int i = 0; i < nums.size() - 2; ++i){
if(i > 0 && nums[i] == nums[i-1]) continue;
int left = i+1, right = nums.size()-1;
while(left < right){
if(diff > abs(nums[left] + nums[right] + nums[i] - target)){
diff = abs(nums[left] + nums[right] + nums[i] - target);
res = nums[left] + nums[right] + nums[i];
}
if(nums[left] + nums[right] < target - nums[i]){
while(left+1 < nums.size() && nums[left+1] == nums[left]) left++;
left++;
}else if(nums[left] + nums[right] > target - nums[i]){
while(right-1 > 0 && nums[right-1] == nums[right]) right--;
right--;
}else{
return target;
}
}
}
return res;
}
};
这个题也可以不用去重复的代码,看别人写的就很简单:
class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
int closest = nums[0] + nums[1] + nums[2];
int diff = abs(closest - target);
sort(nums.begin(), nums.end());
for (int i = 0; i < nums.size() - 2; ++i) {
int left = i + 1, right = nums.size() - 1;
while (left < right) {
int sum = nums[i] + nums[left] + nums[right];
int newDiff = abs(sum - target);
if (diff > newDiff) {
diff = newDiff;
closest = sum;
}
if (sum < target) ++left;
else --right;
}
}
return closest;
}
};