-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtrapping-rain-water.java
61 lines (51 loc) · 1.15 KB
/
trapping-rain-water.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
class Solution {
public int trap(int[] height) {
int[] dp = new int[height.length];
int ans = 0;
int max1 = 0;
for (int i = 0; i < height.length; i++) {
max1 = Math.max(max1, height[i]);
dp[i] = max1;
}
int max2 = 0;
for (int i = height.length - 1; i >= 0; i--) {
max2 = Math.max(height[i], max2);
dp[i] = Math.min(dp[i], max2);
int diff = dp[i] > height[i] ? dp[i] - height[i] : 0;
ans += diff;
}
return ans;
}
}
class Solution {
public int trap(int[] height) {
if (height.length < 3) {
return 0;
}
int i = 0;
int j = height.length - 1;
int iMax = 0;
int jMax = 0;
int ans = 0;
while (i < j) {
if (height[i] < height[j]) {
if (height[i] > iMax) {
iMax = height[i];
} else {
int diff = iMax > height[i] ? iMax - height[i] : 0;
ans += diff;
}
i++;
} else {
if (height[j] > jMax) {
jMax = height[j];
} else {
int diff = jMax > height[j] ? jMax - height[j] : 0;
ans += diff;
}
j--;
}
}
return ans;
}
}