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

解法一：

固定一个数，然后用left和right去算当前最近的值。

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