42. Trapping Rain Water leetcode Python 2016 new season

关注

原创最新推荐文章于 2026-02-16 00:47:51 发布 704 阅读 AI 写同款· GEO 优化 ›

短信验证码接收平台完整搭建教程（超详细版，附完整源码）在网站注册、用户登录、找回密码等功能中，验证码（特别是短信验证码）已成为验证用户身份的常见方式。本教程将详细介绍如何从零搭建一个短信验证码接收平台，用于保存、展示并管理来自短信网关或中间转发程序提交的验证码数据。✅ 教程适合有基本 Python/HTML 基础的开发者🚫 禁止用于任何违法用途，仅供学习参考✅ 支持通过 POST 接口接收短信验证码✅ 支持通过网页实时查看验证码历史记录✅ 验证码信息保存在 SQLite 数据库✅ 支持时间戳排序、查询最新验证码。阅读详情

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.

For example,
Given [0,1,0,2,1,0,1,3,2,1,2,1], return 6.

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!

Show Tags

Show Similar Problems

class Solution(object):
    def trap(self, height):
        """
        :type height: List[int]
        :rtype: int
        """
        if not height:
            return 0
        height_len = len(height)
        maxLeft = [0 for _ in range(height_len)]
        maxRight = [0 for _ in range(height_len)]
        max_value = height[0]
        for index in range(height_len):
            maxLeft[index] = max_value
            if max_value < height[index]:
                max_value = height[index]
        max_value = height[height_len - 1]
        for index in reversed(range(height_len)):
            maxRight[index] = max_value
            if max_value < height[index]:
                max_value = height[index]
        result = 0
        for index in range(height_len):
            water = min(maxRight[index], maxLeft[index]) - height[index]
            if water > 0:
                result += water
        return result