LeetCode—16. 3Sum Closest
题目
https://leetcode.com/problems/3sum-closest/description/
给出一个数组和一个target,找出数组中三个数,是这三个数的和与target的差值最小
Given array nums = [-1, 2, 1, -4], and target = 1.
The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
思路及解法
这道题是15.3Sum的相似题,15是求三个数的和是target,这道题是找三个数和target最接近,思想是一直的,设置三个指针,一个指针固定,另外两个根据变大变小的要求移动。所以一个关键的问题是我们在什么条件下移动左右两个指针,假设三个数的和是sum,当sum大于target时,我们向左移动right指针使sum减小,这样sum就更靠近target,当sum小于target时就向右移动left指针,注意如果sum恰好等于target,则直接返回sum即可。另外还需要定义一个变量closest用来储存之前遍历过得距离最小的三个数的和。
代码
class Solution {
public int threeSumClosest(int[] nums, int target) {
int left = 0;
int right = nums.length-1;
int sum = 0;
int a , b = 0;
int closest = Integer.MAX_VALUE / 2;
Arrays.sort(nums);
for(int i = 0; i < nums.length-2 ; i++){
left = i+1;
right = nums.length-1;
while(left<right && left<nums.length-1){
sum = nums[i]+nums[left]+nums[right];
a = Math.abs(sum-target);
b = Math.abs(closest-target);
closest = a > b ? closest : sum;
if(sum>target){
right--;
}else if(sum<target){
left++;
}else{
return sum;
}
}
}
return closest;
}
}