【leetcode】【medium】16. 3Sum Closest

16. 3Sum Closest

Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution.

Example:

Given array nums = [-1, 2, 1, -4], and target = 1.

The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

题目链接：https://leetcode.com/problems/3sum-closest/

解法

和3sum思路一样，只在目标判断上有一点区别。

class Solution {
public:
    int threeSumClosest(vector<int>& nums, int target) {
        int closet = 99999;
        sort(nums.begin(),nums.end());
        for(int i=0;i<nums.size();++i){
            int l = i+1,r=nums.size()-1;
            while(l<r){
                int sum = nums[i]+nums[l]+nums[r];
                if(sum==target) return target;
                closet = abs(sum-target)<abs(closet-target)?sum:closet;
                if(sum>target) r--;
                else l++;
            }
        }
        return closet;
    }
};