16. 最接近的三数之和

class Solution {
    public int threeSumClosest(int[] nums, int target) {
        int res = Integer.MAX_VALUE, min= Integer.MAX_VALUE;
        //排序
        Arrays.sort(nums);
        for(int i = 0; i < nums.length; i++){
            if(i > 0 && nums[i-1] == nums[i]) {continue;} //去重
            //双指针
            int l = i + 1, r = nums.length - 1;
            while(l < r) {
                int sum = nums[i] + nums[l] + nums[r];
                if(sum == target) {
                     return sum;
                }else if(sum > target) {
                    if(min > sum - target) {
                        min = sum - target;
                        res = sum;
                    }
                    --r;
                }else {
                    if(min > target - sum) {
                        min = target - sum;
                        res = sum;
                    }
                    ++l;
                }
            }   
        }
        return res;
    }
}