算法系列——最接近的三数之和(3Sum Closest)

题目描述

题目链接：https://leetcode-cn.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).

解题思路

这道题的解决方法和 3Sum 一致， 设定三个指针，根据和的大小，移动另外一个。属于这道题自己的东西是 distance比较这块 ,建立一个 tmp distance和min distance 比较 。min distance 总是保存当前的最接近target的差值。

算法分析

public class Solution {
    public int threeSumClosest(int[] nums, int target) {
       if(nums==null||nums.length<3)
            return 0;
        int result=0;
        Arrays.sort(nums);
        int l,r,dist=Integer.MAX_VALUE;
        for(int i=0;i<nums.length-2;i++){
            if(i>0&&nums[i]==nums[i-1]) 
                continue;
            l=i+1;
            r=nums.length-1;
            while(l<r){
                int tempVal=nums[i]+nums[l]+nums[r];
                int tempDist=0;
                if(tempVal==target)
                    return target;
                else if(tempVal>target){
                    tempDist=tempVal-target;
                    if(tempDist<dist){
                        dist=tempDist;
                        result=tempVal;
                    }
                    r--;
                }
                else{
                    tempDist=target-tempVal;
                    if(tempDist<dist){
                        dist=tempDist;
                        result=tempVal;
                    }
                    l++;
                }  
            }
        }
        return result;
    }
}