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

问题分析：

跟15题一个类型，但相较简单。就是找三个数和最接近target的，先排序，再夹逼计算就可以了

解题方法：

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