[Leetcode从零开刷]16. 3Sum Closest

这个题很好理解，给一个数组，返回三个值求和和目标值最近的一个值。

Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution.

Given array nums = [-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 closest = nums[0] + nums[1] +nums[2];
        for(int i = 0;i<nums.size();i++)
        {
            if(i>0 && nums[i] == nums[i-1]) i++;
            int l= i+1;
            int r = nums.size()-1;
            while(l<r)
            {
                int sum = nums[i] + nums[l] + nums[r];
                if(sum == target) return sum;
                if(sum>target)r--;
                else l++;

                if(abs(target-sum) <abs(target-closest))
                    closest = sum;
            }
        }
        return closest;        
    }
};