-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAASum3Closet.java
More file actions
56 lines (53 loc) · 1.4 KB
/
AASum3Closet.java
File metadata and controls
56 lines (53 loc) · 1.4 KB
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
package questions100;
import java.util.ArrayList;
import java.util.Arrays;
public class AaSum3Closet {
public int threeSumClosest(int[] num, int target) {
// Start typing your Java solution below
// DO NOT write main() function
Arrays.sort(num);
int diff = Integer.MAX_VALUE;
int minSum = 0;
for(int i = 0; i< num.length - 2; i++)
{
if(i >0 && num[i] == num[i-1])
continue;
int j = i + 1;
int z = num.length - 1;
while(j < z)
{
int sum = num[i] + num[j] + num[z] ;
int cur_diff = Math.abs(sum - target);
if(sum == target)
{
diff = 0;
break;
}
else if(sum < target)
{
if (cur_diff < diff)
{
diff = cur_diff;
minSum = sum;
}
j ++;
}
else
{
if (cur_diff < diff)
{
diff = cur_diff;
minSum = sum;
}
z--;
}
}
if(diff == 0)
{
minSum = target;
break;
}
}
return minSum;
}
}