3Sum Closest (leetcode 16）

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).

思路 和 3 Sum类似 直接代码
“`
class Solution {
public:
bool absolutionCompare(int a, int b) {
a = a > 0 ? a : -a;
b = b > 0 ? b : -b;
return a > b;
}
int threeSumClosest(vector& nums, int target) {
sort(nums.begin(), nums.end());
int min = nums[0] + nums[1] + nums[2] - target;
for (int i = 0; i < nums.size() - 2; ++i) {
int b = i + 1;
int e = nums.size() - 1;
while(b < nums.size() - 1 && e > b) {
if (nums.size() < 10) {
cout << i << b << e << endl;
}
int tmp = nums[i] + nums[b] + nums[e] - target;
if (absolutionCompare(min, tmp)) {
min = tmp;
}
if (tmp == 0) {
break;
}
if (tmp > 0) {
–e;
continue;
}
if (tmp < 0) {
++b;
continue;
}
}
}

    return min + target;
}

};“`