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

这道题的思路和3sum很相似，先排序，第二轮遍历采用从中间向两边遍历的方法。

class Solution {
public:
    int threeSumClosest(vector<int>& nums, int target) {
        sort(nums.begin(), nums.end());
        int minDelta = INT_MAX;
        int sum;
        for (int i = 0; i < nums.size() - 2; i++) {
            int j = i + 1, k = nums.size() - 1;
            while (j < k) {
                int delta = abs(nums[i] + nums[j] + nums[k] - target);
                if (delta < minDelta) {
                    minDelta = delta;
                    sum = nums[i] + nums[j] + nums[k];
                }

                if (nums[i] + nums[j] + nums[k] < target) j++;
                else if (nums[i] + nums[j] + nums[k] > target) k--;
                else return target;
            }
        }
        return sum;
    }
};