LeetCode 16. 3Sum Closest（最接近的和）

原题网址：https://leetcode.com/problems/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) {
        if (nums == null || nums.length < 3) return 0;
        Arrays.sort(nums);
        int closest = nums[0] + nums[1] + nums[2];
        int diff = Math.abs(closest-target);
        for(int i=0; i<nums.length-2; i++) {
            int lo = i + 1, hi = nums.length - 1;
            do {
                int sum = nums[i] + nums[lo] + nums[hi];
                int di = Math.abs(sum - target);
                if (di < diff) {
                    closest = sum;
                    diff = di;
                }
                if (sum == target) return sum;
                if (sum < target) lo ++;
                else hi --;
            } while (lo < hi);
        }
        return closest;
    }
}