【LeetCode】#16最接近的三数之和(3Sum Closest)

【LeetCode】#16最接近的三数之和(3Sum Closest)

题目描述

给定一个包括 n 个整数的数组 nums 和 一个目标值 target。找出 nums 中的三个整数，使得它们的和与 target 最接近。返回这三个数的和。假定每组输入只存在唯一答案。

示例

例如，给定数组 nums = [-1，2，1，-4], 和 target = 1.
与 target 最接近的三个数的和为 2. (-1 + 2 + 1 = 2).

Description

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

解法

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