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 int threeSumClosest(int[] nums,int target){ int len = nums.length; if(nums==null || len<3){ return 0; } Arrays.sort(nums); int res = nums[0]+nums[1]+nums[len-1]; for(int i=0;i<len-1;i++){ int j=i+1; int k = len-1; while(j<k){ int temp=nums[i] +nums[j]+nums[k]; if(temp>target){ k--; }else{ j++; } if(Math.abs(temp-target)<Math.abs(res-target)){ res = temp; } } } return res; }