3Sum Closest - LeetCode 16

题目描述：
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).

Tags Array Two Pointers

分析：

找出数组中三个数的和与目标和最接近。只需要先排序，然后用双指针逐步遍历数组，构早出所有三元组，。用一个全局变量保存当前

与目标和最接近的即可。如果当前与比目标值相等，那么返回该和即可，若小于目标值那么左指针右移，否则右指针左移。

/**///12ms//*/
class Solution {
public:
    int threeSumClosest(vector<int>& nums, int target) {
        sort(nums.begin(),nums.end());
        int size = nums.size();
        if(size < 3)
            return 0;
        int res = 0; //保存于目标和最接近的和
        res = nums[0] + nums[1] + nums[size-1]; //初始化
        int sum = 0; //遍历数组是计算三个元素的和
        for(int i = 0; i < size-2; i++){
            int j = i+1,k = size -1;        
            while(j < k){ //双指针构造与i位置的三元组的和sum
                sum = nums[i] + nums[j] + nums[k];
                if(abs(res-target) > abs(sum-target)) //更新新res
                    res = sum;
                if(res == target) //判断是否可以立即结束
                    return res;
                if(sum < target) //和比目标值小，右移左指针
                    j++; 
                else  //和比目标值大，左移右指针
                    k--;
            }
        }
        return res;
    }
};