Question:
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly one solution.
For example, given array S = {-1 2 1 -4}, and target = 1. The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
先对数组进行排序,然后从第一个元素及最后一个元素开始向中间夹逼寻找结果。
java代码如下:
public class Solution {
public int threeSumClosest(int[] nums, int target) {
for(int i = 0; i < nums.length; i ++){
for(int j = i + 1; j < nums.length; j ++){
if(nums[i] > nums[j]){
int tmp = nums[i];
nums[i] = nums[j];
nums[j] = tmp;
}
}
}
int res = nums[0] + nums[1] + nums[2];
for(int i = 0; i < nums.length - 2; i ++){
int j = i + 1, k = nums.length - 1;
int temp = target - nums[i];
while(j < k){
if(Math.abs(temp - nums[j] - nums[k]) < Math.abs(target - res))
res = nums[i] + nums[j] + nums[k];
if(nums[j] + nums[k] == temp){
return target;
}
else if(nums[j] + nums[k] < temp){
j ++;
}
else
k --;
}
}
return res;
}
}