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题差不多，做一些简单的变形就行了

15题题解链接 http://blog.csdn.net/accepthjp/article/details/52347224

class Solution {
public:
    int threeSumClosest(vector<int>& nums, int target) {
        sort(nums.begin(),nums.end());
        int result=0,d=INT_MAX;
        for(int i=0;i<(int)nums.size()-2;i++)
        {
            if(i!=0 && nums[i]==nums[i-1])continue;
            int l=i+1,r=(int)nums.size()-1;
            while(l<r)
            {
                int com=(nums[i]+nums[l]+nums[r]);
                if(com<=target)
                {
                    l++;
                   // while(l<r && nums[l]==nums[l-1]) l++;
                    if(target-com<d)
                    {
                        d=target-com;
                        result=com;
                    }
                }
                else
                {
                    r--;
                   // while(l<r && nums[r]==nums[r+1]) r--;
                    if(com-target<d)
                    {
                        d=com-target;
                        result=com;
                    }
                }
            }
        }
        return result;
    }
};