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.
代码语言：txt复制The sum that is closest to the target is 2. (-1 2 1 = 2).
public int threeSumClosest(int[] nums, int target) {
if (nums == null || nums.length < 3) {
return Integer.MIN_VALUE;
}
Arrays.sort(nums);
int minGap = Integer.MAX_VALUE;
int result = 0;
for (int start = 0; start < nums.length; start ) {
int mid = start 1, end = nums.length - 1;
while (mid < end) {
int sum = nums[start] nums[mid] nums[end];
int gap = Math.abs(sum - target);
if (gap < minGap) {
minGap = gap;
result = sum;
}
if (sum < target) {
mid ;
} else {
end--;
}
}
}
return result;
}
