-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTrapping Rain Water.cpp
56 lines (51 loc) · 1 KB
/
Trapping Rain Water.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
#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
int trap(vector<int> &height) {
int n = height.size();
int l = 0, r = n - 1;
while (l < r && height[l] <= height[l + 1])
l++;
while (l < r && height[r] <= height[r - 1])
r--;
int li = l, ri = r;
int ans = 0;
while (l < r) {
if (li < ri && height[li] <= height[ri]) {
l = li;
r = ri;
while (l < r && height[li] >= height[l]) {
ans += height[li] - height[l];
l++;
}
if (l < r) {
li = l;
}
} else if (li < ri) {
l = li;
r = ri;
while (l < r && height[ri] >= height[r]) {
ans += height[ri] - height[r];
r--;
}
if (l < r) {
ri = r;
}
}
}
return ans;
}
};
int main() {
vector<int> v;
int n, k;
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
v.push_back(x);
}
Solution sl;
cout << sl.trap(v);
}