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) {
int len = nums.length;
Arrays.sort(nums);
int min = Math.abs(target - nums[0]- nums[1]-nums[2]);
int res = nums[0]+ nums[1]+nums[2];
for(int i=0;i<len;i++){
int left = i+1;
int right = len-1;
//双指针开始搜索
while(left<right){
int tmp = target - (nums[i] + nums[left] + nums[right]);
if(tmp == 0)return target;
if(Math.abs(tmp)<min){
min = Math.abs(tmp);
res = nums[i] + nums[left] + nums[right];
}
if(tmp<0)right--; //对于指针偏移的操作,要放到最后,避免污染判断
else left++;
}
}
return res;
}
}