# 16. 3Sum Closest (Medium)

https://leetcode.com/problems/3sum-closest/

Given an array `nums` of n integers and an integer `target`, find three integers in `nums` such that the sum is closest to `target`. Return the sum of the three integers. You may assume that each input would have exactly one solution.

Example:

```Given array nums = [-1, 2, 1, -4], and target = 1.

The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
```

## Solutions

• Java
``````class Solution {
public int threeSumClosest(int[] nums, int target) {
Arrays.sort(nums);
int min = Integer.MAX_VALUE, ans = -1;
for (int i = 0, l = nums.length; i < l - 2; i++) {
if (i == 0 || !(nums[i] == nums[i - 1])) {
int j = i + 1, k = l - 1;
while (k > j) {
if (j != i + 1 && (nums[j] == nums[j - 1])) {
j++;
continue;
}
int sum = nums[i] + nums[j] + nums[k];
if (sum < target) {
int diff = Math.abs(sum - target);
if (diff < min) {
min = diff;
ans = sum;
}
j++;
} else if (sum > target) {
int diff = Math.abs(sum - target);
if (diff < min) {
min = diff;
ans = sum;
}
k--;
} else {
return sum;
}
}
}
}
return ans;
}
}
``````