LeetCode 16. 3Sum Closest题目分析代码

public class Solution {
    /**
     * @param numbers: Give an array numbers of n integer
     * @param target : An integer
     * @return : return the sum of the three integers, the sum closest target.
     */
    public int threeSumClosest(int[] numbers, int target) {
        // write your code here
        if(numbers ==  null || numbers.length < 3)
            return -1;
        
        Arrays.sort(numbers);
        
        int bestSum = numbers[0] + numbers[1] + numbers[2];
        
        for(int i=0;i<numbers.length-2;i++) {
            int left = i+1;
            int right = numbers.length-1;
            while(left < right) {
                int sum = numbers[i] + numbers[left] + numbers[right];
                if(Math.abs(bestSum-target) > Math.abs(sum-target))
                    bestSum = sum;
                if(sum < target)
                    left++;
                else
                    right--;
            }
        }
        return bestSum;
    }
}