-
Notifications
You must be signed in to change notification settings - Fork 2
/
16.3-sum-closest.java
38 lines (32 loc) · 1009 Bytes
/
16.3-sum-closest.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
/*
* @lc app=leetcode id=16 lang=java
*
* [16] 3Sum Closest
*/
// @lc code=start
class Solution {
public int threeSumClosest(int[] nums, int target) {
Arrays.sort(nums);
int resultSum = 0;
int closest = Integer.MAX_VALUE;
for (int i = 0; i < nums.length; i++) {
int low = i + 1;
int high = nums.length - 1;
if (i > 0 && nums[i] == nums[i - 1]) continue;
while (low < high) {
int tempSum = nums[i] + nums[low] + nums[high];
if (tempSum == target) {
return target;
} else if (tempSum < target) {
low++;
} else {
high--;
}
resultSum = closest < Math.abs(target - tempSum) ? resultSum : tempSum;
closest = Math.min(closest, Math.abs(target - tempSum));
}
}
return resultSum;
}
}
// @lc code=end