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) { Arrays.sort(num); int close = num[0] + num[1] + num[2]; for(int i = 0 ; i < num.length -1 ; i++){ for(int j = i+1, k= num.length-1;j<k;){ int test = num[i] + num[j] + num[k]; if( test == target) return target; else if(test < target){ j++; } else{ k--; } close = Math.abs(test - target) < Math.abs(close -target) ? test : close; } } return close; } }