给定一个包括 n 个整数的数组 nums 和 一个目标值 target。找出 nums 中的三个整数,使得它们的和与 target 最接近。返回这三个数的和。假定每组输入只存在唯一答案。
示例:
输入:nums = [-1,2,1,-4], target = 1
输出:2
解释:与 target 最接近的和是 2 (-1 + 2 + 1 = 2) 。
提示:
3 <= nums.length <= 10^3
-10^3 <= nums[i] <= 10^3
-10^4 <= target <= 10^4
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/3sum-closest
class Solution {
public int threeSumClosest(int[] nums, int target) {
if(nums == null || nums.length == 0)return 0;
Arrays.sort(nums);
int best = 10000000;
for(int first = 0;first < nums.length-2;first++){
if(first > 0 && nums[first] == nums[first-1])continue;
int second = first+1;
int last = nums.length - 1;
while(second < last){
int sum = nums[first] + nums[second] + nums[last];
if(sum == target){
return sum;
}
if(Math.abs(best - target) > Math.abs(sum - target)){
best = sum;
}
if(sum > target)while(second < last && nums[last] == nums[--last]);
else if(sum < target)while(second < last && nums[second] == nums[++second]);
}
}
return best;
}
}