/
475.java
52 lines (47 loc) · 1.68 KB
/
475.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
__________________________________________________________________________________________________
sample 7 ms submission
class Solution {
public int findRadius(int[] houses, int[] heaters) {
Arrays.sort(houses);
Arrays.sort(heaters);
int i = 0, res = 0;
for(int h: houses) {
while(i < heaters.length - 1 && heaters[i] + heaters[i + 1] <= h * 2) i++;
res = Math.max(res, Math.abs(heaters[i] - h));
}
return res;
}
}
__________________________________________________________________________________________________
sample 8 ms submission
class Solution {
public int findRadius(int[] houses, int[] heaters) {
if(houses == null || heaters == null || houses.length == 0 || heaters.length == 0)
return -1;
Arrays.sort(houses);
Arrays.sort(heaters);
int max = 0,i = 0;
for(int house : houses) {
while(i < heaters.length - 1 && heaters[i] + heaters[i + 1] <= house * 2)
i++;
max = Math.max(max, Math.abs(house - heaters[i]));
}
return max;
}
}
__________________________________________________________________________________________________
sample 40136 kb submission
public class Solution {
public int findRadius(int[] houses, int[] heaters) {
Arrays.sort(houses);
Arrays.sort(heaters);
int i = 0, res = 0;
for (int house : houses) {
while (i < heaters.length - 1 && heaters[i] + heaters[i + 1] <= house * 2) {
i++;
}
res = Math.max(res, Math.abs(heaters[i] - house));
}
return res;
}
}