LeetCode——3Sum Closest

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

解法

和3Sum这题相似，固定一个值后在它后面寻找合适的另外两个数字，本来准备多加一点判断条件提高代码的效率，但是思路不够清晰没写出来，以后再来改吧，如果有更好更清晰的代码欢迎在评论区贴出来一起学习。

public int threeSumClosest(int[] nums, int target) {
        int res=0;
        int diff=Integer.MAX_VALUE;
        Arrays.sort(nums);
        for(int i=0;i<nums.length-2;i++)
        {
        	int j=i+1,k=nums.length-1;
        	while(j<k)
        	{
        		int sum=nums[i]+nums[j]+nums[k];
        		if(sum==target)
        			return target;
        		else
        		{
        			if(diff>Math.abs(target-sum))
            			{
            				diff=Math.abs(target-sum);
            				res=sum;
            			}
        			if(sum<target)
        				j++;
        			else
        				k--;
        		}
        	}
        }
        return res;
    }

Runtime: 11 ms, faster than 71.58% of Java online submissions for 3Sum Closest.
Memory Usage: 38.1 MB, less than 38.82% of Java online submissions for 3Sum Closest.