>>109096253
You have to solve this problem before replying.
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.
Example 1:
Input: height = [0,1,0,2,1,0,1,3,2,1,2,1]
Output: 6
Example 2:
Input: height = [4,2,0,3,2,5]
Output: 9
Constraints:
n == height.length
1 <= n <= 2 * 10^4
0 <= height[i] <= 10^5
from typing import List
class Solution:
def trap(self, height: List[int]) -> int:
# Your solution here
pass
if __name__ == "__main__":
s = Solution()
assert s.trap([0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1]) == 6
assert s.trap([4, 2, 0, 3, 2, 5]) == 9
assert s.trap([]) == 0
assert s.trap([5]) == 0
print("All tests passed!")
