[LeetCode] 3Sum Closest

最新推荐文章于 2020-12-31 13:22:18 发布

EchoChen1992

最新推荐文章于 2020-12-31 13:22:18 发布

阅读量284

点赞数

分类专栏： LeetCode 文章标签： LeetCode java

本文链接：https://blog.csdn.net/EchoChen1992/article/details/50034913

版权

LeetCode 专栏收录该内容

29 篇文章 0 订阅

订阅专栏

题目

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

思路

有了上一道题的基础，这道题不是太难，也是Two Pointers的思想。对于排过序的数组中的任意元素nums[i]，在[i+1，n-1]下标区间内寻找两个数使这三个数的和最接近target，注意这里的最接近是基于两者之差的绝对值。

代码

public class Solution {
    public int threeSumClosest(int[] nums, int target) {
        int n = nums.length;
        if (nums == null || n < 3)
            return 0;
        Arrays.sort(nums);
        
        int closestSum = nums[0] + nums[1] + nums[2];
        if (closestSum >= target)
            return closestSum;
        
        for (int i = 0;i < n - 2;i++) {
            int l = i + 1;
            int r = n - 1;
                
            while (l < r) {
                int sum = nums[i] + nums[l] + nums[r];
                if (Math.abs(sum - target) < Math.abs(closestSum - target))
                    closestSum = sum;
                if (sum == target)
                    return sum;
                else if (target > sum)
                    l++;
                else
                    r--;
            }
        }
        return closestSum;
    }
}