leetcode

0 class Solution {

1 public:

2 int trap(vector<int> &height) {

3 int ans = 0, n = height.size(), maxi, m1, m2;

4 vector<int> mleft(n), mright(n);

5

6 m1 = m2 = INT_MIN;

7 for (int i = 0; i < n; i++) {

8 mleft[i] = m1 = max(m1, height[i]);

9 mright[n - i - 1] = m2 = max(m2, height[n - i - 1]);

10 }

11

12 for (int i = 1; i < n - 1; i++)

13 ans += min(mleft[i], mright[i]) - height[i];

14 return ans;

15 }

16 };