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

大意：

给定包含n个整数数组S，找到S中的三个整数，从而使之和最接近给定的数。返回三个整数的总和。你可以假设每个输入将有一个确切的解决。

思路：

和3sum解法类似，详见上一篇博客。

代码：

public class Solution {
    public int threeSumClosest(int[] nums, int target) {
        int minDiff = Integer.MAX_VALUE; //最小差值
        int diff = 0; //每一轮sum与target的差值
        int sum = 0; //每一轮的三个数字和
        int result = 0; //最终结果

        Arrays.sort(nums);
        for(int i = 0; i < nums.length - 2; i++) {
            //j,k由两端向中间靠拢
            int j = i + 1;
            int k = nums.length - 1;
            while(j < k) {
                sum = nums[i] + nums[j] + nums[k];
                diff = Math.abs(sum - target);
                //差值为0直接返回
                if(diff == 0) {
                    return sum;
                }
                //新的差值小于最小差值，更新最小差值
                if(diff < minDiff) {
                    minDiff = diff;
                    result = sum;
                }
                //三个数字的和大于target，将k左移
                if(sum > target) {
                    k--;
                } else { //三个数字的和小于target，将j右移
                    j++;
                }
            }
        }
        return result;
    }
}

转自：DERRANTCM博客