leetcode --

题目描述

Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution.

Example:

Given array nums = [-1, 2, 1, -4], and target = 1.

The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

AC代码

class Solution {
    public int threeSumClosest(int[] nums, int target) {
        if(nums == null ||nums.length < 3) return -1; //保证程序的健壮性，虽然此题不需要
        Arrays.sort(nums);
        int min = Integer.MAX_VALUE;
        for(int i = 0;i < nums.length - 2;i++){
            if(i > 0 && nums[i] == nums[i - 1]) continue; //避免重复计算
            int low = i + 1, high = nums.length - 1;
            while(low < high){
            int sum = nums[i] + nums[low] + nums[high];
            //if(sum == target) return target; 这段代码在某些情况下可以提前结束函数，但是这种情况很少，大多数情况都不行。不加这段代码打败了80%多，加上后仅打败了20%多。所以这并不算优化。
            if(Math.abs(sum - target) < Math.abs(min)) min = sum - target;
            if(sum < target) low++;
            else high--;
            }
        }
        return min + target;
    }
}