Problem: Trapping RainWater
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.
Constraints:
n == height.length
1 <= n <= 2 * 104
0 <= height[i] <= 105
class Solution {
...
mackph.hashnode.dev1 min read