最接近给定值的三数之和 3Sum Closest

2019独角兽企业重金招聘Python工程师标准>>>

问题：

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类似，只是另外设置一个变量diff来记录与三个数之和差值最小的值即可。

class Solution {//23ms
    int res = 0;
    int diff = Integer.MAX_VALUE;
    public int threeSumClosest(int[] nums, int target) {
        Arrays.sort(nums);
        for (int i = 0;i < nums.length - 2 ;i ++ ) {
            findOther(nums,i + 1,nums.length - 1,nums[i],target);
        }
        return res;
    }
    public void findOther(int[] nums,int begin,int end,int sum1,int target){
        while(begin < end){
            int sum = sum1 + nums[begin] + nums[end];
            int newDiff = Math.abs(sum - target);
            if(diff > newDiff){
                diff = newDiff;
                res = sum;
            }
            if(sum < target) begin ++;
            else end --;
        }
    }
}

② 在discuss中看到了这个解法，效率最高。。。。

public class Solution { //12ms
    public int threeSumClosest(int[] nums, int target) {
        Arrays.sort(nums);
        int len = nums.length;
        int less = nums[0] + nums[1] + nums[2];
        int more = nums[len - 3] + nums[len - 2] + nums[len - 1];
        if(less >= target) return less;
        if(more <= target) return more;
        for(int i = 0; i < len - 2; i ++){
            int min = nums[i] + nums[i + 1] + nums[i + 2];
            if(min > target){
                if(more > min) more = min;
                break;
            }
            int max = nums[i] + nums[len - 2] + nums[len - 1];
            if(max < target){
                if(less < max) less = max;
                continue;
            }
            int low = i + 1;
            int high = len - 1;
            while(low < high){ //查找另外两个
                int sum = nums[low] + nums[high] + nums[i];
                if(sum == target){
                    return target;
                }else if(sum < target){
                    if(less < sum) less = sum;
                    while(++ low < len - 1 && nums[low] == nums[low - 1]) ;
                }else{
                    if(more > sum) more = sum;
                    while(-- high > i + 1 && nums[high] == nums[high + 1]) ;
                }
            }
        }
        if(more == target) return less;
        if(less == target) return more;
        if((more - target) > (target - less)){
            return less;
        }
        return more;      
    }
}

转载于:https://my.oschina.net/liyurong/blog/1523804