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).
public class Solution {
public int threeSumClosest(int[] num, int target) {
// Start typing your Java solution below
// DO NOT write main() function
if(num.length <3) return 0;
Arrays.sort(num);
int i=0,j,k,a,b,c;
int res=0, closestAbs=Integer.MAX_VALUE;
while(i<=num.length-3){
a=num[i];
j=i+1;
k=num.length-1;
while(j<k){
b=num[j];
c=num[k];
int sum = a+b+c;
int diff = sum-target;
if(diff==0)
return sum;
else if(diff<0)
j++;
else if(diff>0)
k--;
if(Math.abs(diff)<closestAbs){
closestAbs = Math.abs(diff);
res = sum;
}
}
i++;
}
return res;
}
}