Leetcode 42 接雨水

def trap(self, height: List[int]) -> int:
        #这题有点难想～
    
        n,S_1,S_2,max_1,max_2=len(height),0,0,0,0
        for i in range(n):
            if height[i]>max_1: max_1=height[i]
            if height[n-i-1]>max_2: max_2=height[n-i-1]
            S_1+=max_1
            S_2+=max_2
        return S_1+S_2-max_1*n-sum(height)