-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathQuestion4.java
33 lines (27 loc) · 861 Bytes
/
Question4.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
public class Question4 {
public static int trap(int arr[]) {
int n = arr.length;
// Leftmax
int leftmax[] = new int[n];
leftmax[0] = arr[0];
for (int i = 1; i < n; i++) {
leftmax[i] = Math.max(leftmax[i - 1], arr[i]);
}
// Rightmax
int rightmax[] = new int[n];
rightmax[n - 1] = arr[n - 1];
for (int i = n - 2; i >= 0; i--) {
rightmax[i] = Math.max(rightmax[i +1], arr[i]);
}
int trappedwater = 0;
for (int i = 0; i < n; i++) {
int waterlevel = Math.min(leftmax[i], rightmax[i]);
trappedwater += waterlevel - arr[i];
}
return trappedwater;
}
public static void main(String[] args) {
int arr[] = { 4, 2, 0, 3, 6, 2, 5 };
System.out.println(trap(arr));
}
}