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

该题目和第15题点击打开链接解题思路和想法都类似，都是先进行排序，再去重，最后计算差值。

该题答案如下：

public int threeSumClosest(int[] nums, int target) {
        if (nums == null || nums.length < 3) {
            return Integer.MIN_VALUE;
        }
        int diff = Integer.MAX_VALUE;
        int result = Integer.MAX_VALUE;
        Arrays.sort(nums);
        int length = nums.length;
        for (int i = 0; i < length - 2; i++) {
            if (i > 0 && nums[i] == nums[i - 1]) {
                continue;
            }
            int left = i + 1;
            int right = length - 1;
            while (left < right) {
                int sum = nums[i] + nums[left] + nums[right];
                if (sum  == target) {
                    return target;
                } else if (sum > target) {
                    if(sum - target < diff) {
                        diff = sum - target;
                        result = sum;
                    }
                    right--;
                } else {
                    if (target - sum < diff) {
                        diff = target - sum;
                        result = sum;
                    }
                    left++;
                }
            }
        }
        return result;
    }