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).
求三个数字的和最接近目标值target

    public int threeSumClosest(int[] nums, int target) {
        Arrays.sort(nums);
        int minCount = nums[0] + nums[1] + nums[nums.length-1];
        for (int i = 0; i < nums.length; i++) {
            int low = i + 1, high = nums.length - 1;
            while (low < high) {
                int count =  nums[i] + nums[low] + nums[high];
                if(count > target)
                {
                    high--;
                }else
                {
                    low++;
                }
                if (Math.abs(count - target) < Math.abs(minCount - target))
                    minCount = count;
            }
        }
        return minCount;     
    }