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).
同3sum做法,套路啊套路
class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
sort(nums.begin(), nums.end());
int ans = nums[0] + nums[1] + nums[2];
for (int i = 0; i < nums.size(); ++i) {
if (i == 0 || nums[i] != nums[i-1]) {
int le = i + 1, ri = nums.size() - 1;
while (le < ri) {
int sum3 = nums[le] + nums[ri] + nums[i];
if (abs(ans - target) > abs(sum3 - target))
ans = sum3;
if (sum3 < target) {
le++;
while (le < ri && nums[le] == nums[le-1]) le++;
}
else {
ri--;
while (le < ri && nums[ri] == nums[ri+1]) ri--;
}
}
}
}
return ans;
}
};