难度:中等
给定一个包括 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
代码:(暴力循环,可以过,但是花了18ms)
class Solution {
public int threeSumClosest(int[] nums, int target) {
//尝试所有组合
//与目标值相等则直接返回
int closest = Integer.MAX_VALUE - Math.abs(target);
for (int i = 0; i < nums.length - 2; i++) {
for (int j = i + 1; j < nums.length - 1; j++) {
for (int k = j + 1; k < nums.length; k++) {
int sum = nums[i] + nums[j] + nums[k];
if (sum - target == 0)
return sum;
if (Math.abs(closest - target) > Math.abs(sum - target))
closest = sum;
}
}
}
return closest;
}
}
代码: (排序+双指针)
class Solution {
public int threeSumClosest(int[] nums, int target) {
//排序
Arrays.sort(nums);
//遍历第一个数,第二个数和第三个数用双指针
int closest = Integer.MAX_VALUE - Math.abs(target);
for (int i = 0; i < nums.length - 2; i++) {
int left = i + 1, right = nums.length - 1;
while (left < right) {
int sum = nums[i] + nums[left] + nums[right];
if (sum == target)
return sum;
else if (sum > target) {
right--;
} else left++;
//更新最接近值
if (Math.abs(closest - target) > Math.abs(sum - target))
closest = sum;
}
}
return closest;
}
}