class Solution:
def trap(self, height: List[int]) -> int:
l,r=0,len(height)-1
mleft,mright=height[0],height[-1]
ans=0
while l<r:
if mleft<mright:
l+=1
mleft=max(mleft,height[l])
ans+=mleft-height[l]
else:
r-=1
mright=max(mright,height[r])
ans+=mright-height[r]
return ans
模拟题
ans+=...