LeetCode Java First 400 题解-016-CSDN博客

本文链接：https://blog.csdn.net/felomeng/article/details/102811101

本文深入解析了3SumClosest算法，该算法旨在从整数数组中寻找三个数，使其和最接近给定目标值。通过排序和双指针技巧，文章详细介绍了算法的实现过程，以及如何优化解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

public int threeSumClosest(int[] nums, int target) {

    Arrays.sort(nums);

    int closest = Integer.MAX_VALUE;

    int i = 0;

    while (i < nums.length - 2) {

        int j = i + 1;

        int k = nums.length - 1;

        while (j < k) {

            int sum = nums[i] + nums[j] + nums[k];

            if (closest == Integer.MAX_VALUE

                    || Math.abs(closest - target) > Math.abs(sum - target)) {

                closest = sum;

            }

            if (sum == target) return sum;

            if (sum <= target) while (nums[j] == nums[++j] && j < k) ;

            if (sum >= target) while (nums[k--] == nums[k] && j < k) ;

        }

        while (nums[i] == nums[++i] && i < nums.length - 2) ;

    }

    return closest;

}

思路：与上一题一致，不同处：在判断Sum时不是看是不是=0，而是看是不是更接近target。