-
Notifications
You must be signed in to change notification settings - Fork 2
/
ThreeSumClosest.java
66 lines (58 loc) · 1.91 KB
/
ThreeSumClosest.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
package Leetcode;
import java.util.Arrays;
/**
* @author kalpak
*
* 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
*/
public class ThreeSumClosest {
public static int threeSumClosest(int[] nums, int target) {
Arrays.sort(nums);
int result = nums[0]+nums[1]+nums[2];
for(int i = 0; i < nums.length - 2; i++) {
if (i == 0 || nums[i] != nums[i - 1]) {
int left = i+1;
int right = nums.length - 1;
while(left < right) {
int sum = nums[left] + nums[right] + nums[i];
if(sum == target) {
// best case solution.
return sum;
} else if (sum < target) {
// Remove duplicate nums[left] and nums[right] elements
while(left < right && nums[left] == nums[left+1])
left++;
left++;
} else {
while(left < right && nums[right] == nums[right-1])
right--;
right--;
}
if(Math.abs(target - sum) < Math.abs(target - result))
result = sum;
}
}
}
return result;
}
public static void main(String[] args) {
int[] nums = new int[]{-1,2,1,-4};
System.out.println(threeSumClosest(nums, 1));
}
}