[LeetCode] 16. 3Sum Closest

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>& nums, int target) {
sort(nums.begin(), nums.end());

int AbsMinDelta = target - (nums[0] + num
4000
s[1] + nums[2]);
for (int j = 1; j < nums.size() - 1; j++) {
int i = 0, k = (int)nums.size() - 1;
while (i < j && k > j) {
int delta = target - (nums[i] + nums[j] + nums[k]);
AbsMinDelta = abs(AbsMinDelta) < abs(delta) ? AbsMinDelta : delta;
if (delta > 0) {
i++;
} else if (delta < 0) {
k--;
} else {
break;
}
}
}

return target - AbsMinDelta;
}
};