[LeetCode] 3Sum Closest

This problem is very similar to 3Sum. You only need to maintain a variable for the sum that is closet to target. Also, some corner cases need to be handled; for example, nums does not have more than 2 elements.

The code is as follows, which is quite self-explanatory.

int threeSumClosest(vector<int>& nums, int target) {
sort(nums.begin(), nums.end());
while (nums.size() <= 2)
return accumulate(nums.begin(), nums.end(), 0);
int ans = nums[0] + nums[1] + nums[2];
for (int i = 0; i < nums.size() - 2; i++) {
int left = i + 1, right = nums.size() - 1;
while (left < right) {
int temp = nums[i] + nums[left] + nums[right];
if (abs(temp - target) < abs(ans - target))
ans = temp;
if (temp == target) return ans;
if (temp > target) right--;
else left++;
}
}
return ans;
}