-
Notifications
You must be signed in to change notification settings - Fork 0
/
42.py
24 lines (17 loc) · 642 Bytes
/
42.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
# 42. Trapping Rain Water
# Given n non-negative integers representing an elevation map where the width of each bar is 1,
# compute how much water it is able to trap after raining.
# The above elevation map is represented by array [0,1,0,2,1,0,1,3,2,1,2,1].
# In this case, 6 units of rain water (blue section) are being trapped.
# Thanks Marcos for contributing this image!
# Example:
# Input: [0,1,0,2,1,0,1,3,2,1,2,1]
# Output: 6
from typing import List
class Solution:
def trap(self, height: List[int]) -> int:
# corner case
if len(height) == 0:
return 0
result = 0
return result