LeetCode16. 3Sum Closest 三数之和改

16.3Sum Closest最接近目标值的三数之和

3Sum Closest

Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution.

Example:

Given array nums = [-1, 2, 1, -4], and target = 1.

The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

基于三数之和的修改

解决问题的思路和LeetCode15 3Sum三数之和是一致的，只不过在处理的时候有所不同。同样采用的也是双指针的方式。在每次指针移动的时候都要去比较目前的值到目标值的距离和之前最近的值到距离的大小，记录最接近目标值用于下一次进行比较。

class Solution {
    public int threeSumClosest(int[] nums, int target) {
        Arrays.sort(nums);
        int numsLen = nums.length;
        int result = nums[0] + nums[1] + nums[2];
        for(int i = 0 ; i < numsLen - 2; i++){
            if(i > 0 && nums[i] == nums[i-1]){
                continue;
            }            
            int left = i+ 1;
            int right = nums.length -1;
            while(left < right){
                int sum = nums[i] + nums[left] + nums[right];
                if(sum < target){
                    if(Math.abs(target - sum) < Math.abs(target - result)){
                        result = sum;
                    }
                    left++;
                 while(left < right && nums[left] == nums[left - 1]){
                    left++;
                }
                } else if(sum > target){
                    if(Math.abs(target - sum) < Math.abs(target - result)){
                        result = sum;
                    }
                    right--;
                while(left < right && nums[right] == nums[right + 1]){
                    right--;
                }
                } else {
                    return target;
                }
            }
        }
        return result;
    }
}