[leetcode] 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的解法，先排序，然后找到最接近target的和

代码：

class Solution {
public:
    int threeSumClosest(vector<int> &num, int target) {
        int len=num.size();
        if(len<=2) return INT_MIN;
        sort(num.begin(),num.end());
        int min=num[0]+num[1]+num[2]-target;
        for(int i=1;i<len;i++){
            int left=0,right=len-1;
            while(left<i && right>i){
                int sum=num[left]+num[i]+num[right]-target;
                if(sum==0) return target;
                if(abs(sum)<abs(min)) min=sum;
                if(sum>0){
                    right--;
                }else{
                    left++;
                }
            }
        }
        return min+target;
    }
};