方法一:暴力(超时)
class Solution:
def trap(self, height: List[int]) -> int:
ans = 0
size = len(height)
for i in range(size):
max_left = 0
max_right = 0
for j in range(i, -1, -1):
max_left = max(max_left, height[j])
for k in ran