-
Notifications
You must be signed in to change notification settings - Fork 0
/
trappingRainWater.cpp
58 lines (45 loc) · 1.15 KB
/
trappingRainWater.cpp
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
// { Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution{
// Function to find the trapped water between the blocks.
public:
long long trappingWater(int arr[], int n){
// code here
long long ans = 0;
int left[n]; int right[n];
left[0] = arr[0];
for(int i=1; i<n; ++i){
left[i] = max(left[i-1], arr[i]);
}
right[n-1] = arr[n-1];
for(int i=n-2; i>=0; i--){
right[i] = max(right[i+1], arr[i]);
}
for(int i=0; i<n; ++i){
ans += max(0, min(left[i], right[i])-arr[i]);
}
return ans;
}
};
// { Driver Code Starts.
int main(){
int t;
//testcases
cin >> t;
while(t--){
int n;
//size of array
cin >> n;
int a[n];
//adding elements to the array
for(int i =0;i<n;i++){
cin >> a[i];
}
Solution obj;
//calling trappingWater() function
cout << obj.trappingWater(a, n) << endl;
}
return 0;
} // } Driver Code Ends