(Java)LeetCode-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).

这道题借鉴上一题是，思路是一模一样的~代码如下：

public class Solution {    public int threeSumClosest(int[] nums, int target) {        Arrays.sort(nums);        int sub_target;        int min_dif = Integer.MAX_VALUE;        for(int i = 0; i < nums.length-2; i++){        sub_target = target - nums[i];        int j = i+1;        int k = nums.length - 1;             while(j < k){        int dif = sub_target-(nums[j]+nums[k]);        if(Math.abs(min_dif)>Math.abs(dif)){        min_dif = dif;                }        if(nums[j] + nums[k] == sub_target){            return target;        }        else if(nums[j] + nums[k] > sub_target){        while(j<--k && nums[k] == nums[k+1]);        }else{        while(++j<k && nums[j] == nums[j-1]);        }        }              }        int closet_num = target - min_dif;    return closet_num;    }}