0016. 3Sum Closest

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

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