LeetCode-16. 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).

二、解题思路

给定一个int数组和目标值，计算数组中三数之和最接近于目标值的值。该题的解题思路类似于 LeetCode-15。

三、代码

public class Solution {
    public int threeSumClosest(int[] nums, int target) {
        if(nums==null || nums.length<=2)
            return 0;
        int result=nums[0]+nums[1]+nums[2];
        Arrays.sort(nums);
        for(int i=0;i<nums.length-2;i++){
            if(i==0 || (i>0 && nums[i]!=nums[i-1])){
                int j=i+1;
                int k=nums.length-1;
                while(j<k){
                    int temp=nums[i]+nums[j]+nums[k]-target;
                    if(Math.abs(temp)<Math.abs(result-target))
                        result=temp+target;
                    if(temp>0)
                        k--;
                    else if(temp==0)
                        return result;
                    else
                        j++;
                }
            }
        }
        return result;
    }
}

注意：本人一开始将result初设为Integer,MAX_VALUE，这样在执行第十三行代码时，如果target值是负值，会发生溢出现象，导致运行错误