leetcode题解-16. 3Sum Closest

和 3Sum解题报告很像，但不同的是，不再是求三个数的和是不是为0，而是看三个数的和与target的差是否为最小，只需记录当前最优解closest并不断更新其值就可。但是容易出错的地方是，把 closest 初始值设为 Integer.MAX_VALUE，然后后面计算 closest = Math.abs(closest - target)，这样会导致溢出。

import java.util.Arrays;

class Solution {
    public static int threeSumClosest(int[] nums, int target) {
        Arrays.sort(nums);
        // -4,-1,-1,0,1,2
        int len = nums.length;
        int closest = Integer.MAX_VALUE / 2;
        for(int i = 0; i < len - 2; i++){
            int k = len - 1;
            int j = i + 1;
            while(j < len - 1 && j < k){
                int sum = nums[i] + nums[j] + nums[k];
                int a = Math.abs(closest - target);
                int b =  Math.abs(sum - target);
                closest = a < b?
                        closest : sum;
                if(sum < target){
                    j++;
                }else if(sum > target){
                    k--;
                }else{
                    return sum;
                }
            }
        }
        return closest;
    }
    public static void main(String[] args) {
        int[] nums = {-3,-2,-5,3,-4};
        System.out.println(threeSumClosest(nums, -1));
    }
}