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).

先排序再二分，情况比3sum要简单！

code in Java:

  public int threeSumClosest(int[] nums, int target) {
        int length = nums.length;
        int min = Integer.MAX_VALUE;
        int left, right, comp, result = 0;
 
        if (length < 3)
            return 0;
        Arrays.sort(nums);
 
        for (int i = 0; i < length - 2; i++) {
            left = i + 1;
            right = length - 1;
            while (left < right) {
                comp = nums[i] + nums[left] + nums[right];
                if (Math.abs(comp - target) < min){
                    min = Math.abs(comp - target);
                    result = comp;
                }
                if (comp > target)
                    right--;
                else if (comp < target)
                    left++;
                else
                    return target;
            }
        }
        return result;
    }