题目描述:
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly one solution.
例子:
For example, given array S = {-1 2 1 -4}, and target = 1. The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
分析:
题意:给定一个包含n个整数的数组S和目标值target,求唯一解三元组(a, b, c),使得a+b+c和target最近。
思路:此题和LeetCode 15如出一辙,只是给出了一个target目标值,我们只需要在细节上做一些改进:①此时sum等于target,则找到唯一解,直接返回;②此时sum不等于target,则判断他们之间的差距是否减少,若减少,则更新答案ans和对应的差距delta。其它的处理方法不变。
时间复杂度为O(nlogn)+O(n²)=O(n²)。
代码:
#include <bits/stdc++.h>
using namespace std;
class Solution {
private:
static int cmp(const int a, const int b){
return a < b;
}
public:
int threeSumClosest(vector<int>& nums, int target) {
int n = nums.size();
// Exceptional Case:
if(n <= 2){
return 0;
}
// sort
sort(nums.begin(), nums.end(), cmp);
int ans, delta = INT_MAX;
int left, right;
for(int i = 0; i <= n - 3;){
left = i + 1;
right = n - 1;
bool flag = false;
while(left < right){
int sum = nums[i] + nums[left] + nums[right];
// debug
// cout << "sum: " << sum << ", i: " << i << ", left: " << left << ", right: " << right << endl;
if(sum == target){
ans = sum;
flag = true;
break;
}
else if(sum < target){
// check
if(target - sum < delta){
delta = target - sum;
ans = sum;
}
left++;
while(left < right && nums[left] == nums[left - 1]){
left++;
}
}
else if(sum > target){
// check
if(sum - target < delta){
delta = sum - target;
ans = sum;
}
right--;
while(left < right && nums[right] == nums[right + 1]){
right--;
}
}
}
if(flag){
break;
}
i++;
while(i <= n - 3 && nums[i] == nums[i - 1]){
i++;
}
}
return ans;
}
};