每日leetcode4.5（接雨水）-待更新

每日leetcode两题4.4-接雨水

42 接雨水（hard）

from typing import List


class Solution:
    def trap(self, height: List[int]) -> int:
        l = len(height)
        dpl = [0] * l
        dpr = [0] * l
        for i in range(1, l):
            dpl[i] = max(height[i - 1], dpl[i - 1])
            dpr[l - i - 1] = max(height[l - i], dpr[l - i])
        ans = 0
        for i in range(l):
            ans += max(min(dpl[i], dpr[i]) - height[i], 0)
        return ans


if __name__ == '__main__':
    x = Solution()
    h = [0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1]
    print(x.trap(h))

42 接雨水二（hard）

待解决