-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmaximum-building-height.java
More file actions
55 lines (38 loc) · 1.27 KB
/
Copy pathmaximum-building-height.java
File metadata and controls
55 lines (38 loc) · 1.27 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
class Solution {
public int maxBuilding(int n, int[][] restrictions) {
int m = restrictions.length;
int[][] arr = new int[m + 2][2];
arr[0][0] = 1;
arr[0][1] = 0;
for (int i = 0; i < m; i++) {
arr[i + 1] = restrictions[i];
}
arr[m + 1][0] = n;
arr[m + 1][1] = n - 1;
Arrays.sort(arr, (a, b) -> a[0] - b[0]);
int len = arr.length;
// Left -> Right
for (int i = 1; i < len; i++) {
int d = arr[i][0] - arr[i - 1][0];
arr[i][1] = Math.min(arr[i][1],
arr[i - 1][1] + d);
}
// Right -> Left
for (int i = len - 2; i >= 0; i--) {
int d = arr[i + 1][0] - arr[i][0];
arr[i][1] = Math.min(arr[i][1],
arr[i + 1][1] + d);
}
long ans = 0;
for (int i = 1; i < len; i++) {
long x1 = arr[i - 1][0];
long h1 = arr[i - 1][1];
long x2 = arr[i][0];
long h2 = arr[i][1];
long d = x2 - x1;
long peak = (h1 + h2 + d) / 2;
ans = Math.max(ans, peak);
}
return (int) ans;
}
}