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).
class Solution {
public:
int threeSumClosest(vector<int> &num, int target) {
int threeSum = 0, least = INT_MAX;
sort(num.begin(), num.end());
for (int i = 0; i < num.size(); i++) {
int newTarget = target - num[i];
int j = i + 1, k = num.size() - 1;
while (j < k) {
int tempVal = abs(newTarget - num[j] - num[k]);
if (least > tempVal) {
least = tempVal;
threeSum = num[i] + num[j] + num[k];
}
if ( num[j] + num[k] > newTarget)
k--;
else
j++;
}
}
return threeSum;
}
};