https://leetcode.com/problems/3sum-closest/#/description
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).
Subscribe to see which companies asked this question.
Java code:
package go.jacob.day618;
import java.util.Arrays;
/**
* 16. 3Sum Closest
*
* @author Administrator
*
*/
public class Demo3 {
public int threeSumClosest(int[] nums, int target) {
if (nums == null || nums.length < 3)
return Integer.MIN_VALUE;
int result = nums[0] + nums[1] + nums[nums.length - 1];
Arrays.sort(nums);
for (int i = 0; i < nums.length - 2; i++) {
int left = i + 1, right = nums.length - 1;
while (left < right) {
int sum = nums[i] + nums[left] + nums[right];
if (sum > target)
right--;
else
left++;
if (Math.abs(sum - target) < Math.abs(result - target))
result = sum;
}
}
return result;
}
}