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 1:
Input: nums = [-1,2,1,-4], target = 1
Output: 2
Explanation: The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
Constraints:
3 <= nums.length <= 10^3
-10^3 <= nums[i] <= 10^3
-10^4 <= target <= 10^4
class Solution {
public int threeSumClosest(int[] nums, int target) {
Arrays.sort(nums);
long ans = (long) Integer.MAX_VALUE + 1;
for (int i = 0; i + 2 < nums.length; i++) {
int j = i + 1, k = nums.length - 1;
while (j < k) {
int sum = nums[i] + nums[j] + nums[k];
if (sum == target)
return sum;
else if (Math.abs(target - sum) < Math.abs(target - ans))
ans = sum;
if(sum>target)
k--;
else
j++;
}
}
return (int)ans;
}
}
Last updated