python第八周作业2：LeetCode Trapping Rain Water

最新推荐文章于 2020-07-15 12:29:08 发布
最新推荐文章于 2020-07-15 12:29:08 发布
阅读量143 收藏
点赞数
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/weixin_38742280/article/details/80127019
版权

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.


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!

Example:

Input: [0,1,0,2,1,0,1,3,2,1,2,1]
Output: 6

思路：用一个数组leftmax[i]来存储i前最大的bar值，然后再从右边开始遍历列表并始终维护一个代表右边最大的bar值的数。

对于每个遍历的元素，该位置能储存的雨水量应为：min(左边最大的bar值，右边最大的bar值) - 当前位置的bar值。

这个算法的时间复杂度为O(n)，源代码如下：


Xiami2019
关注
Leetcode | C++ 42-Trapping Rain Water
weixin_54707168的博客
07-10 197
题目分析： 给你n个非负整数表示n个连续区域各自的海拔，每个区域宽度为1，问一场足够大的雨后有多少单位的水能储存在里面。也可以理解成在一个有若干黑块和白块的矩形中，有多少个白块的左边和右边（不一定相邻）都至少有一个黑块。 解题思路（1）： 可以开个二维矩阵存每个位置是黑块还是白块，然后一行一行扫描，记下最左和左右的黑块位置l、r和总黑块数cnt，这一行的答案就为r-l-cnt+2，最终答案就是每一行的答案和。这种方法时空复杂度都为O(n*max(height))，当数据很大的时候这种方法是不能接受的。 解题
42. Trapping Rain Water接水Python
weixin_44516745的博客
08-01 218
给定n个表示高度的非负整数，其中每个条的宽度为1，计算下雨后它能捕获多少水。 Input：[0,1,0,2,1,0,1,3,2,1,2,1] Output：6 Method 1 以数组中最大值为标准，area=max×len(height)。每次循环都减掉没有达到最大值的部分的那层。如下图，第一次减掉黄色的部分，第二次减掉蓝色的部分，第三次减掉粉色的部分。最后结果减掉所有数的和，剩下的就是装水量。 用l和r代表左右两侧，每次l从0开始，r从数组的长度开始向中间合并。当l或者r位置的值小于数
九章算法高级班笔记3.数据结构（下）
weixin_30352191的博客
11-02 227
Heap c cs3k.com Heap基本原理 Heap 问题的拓展 Hashheap Hashheap 运用 Stack 反转栈里面元素 单调栈的运用 Trapping Rain Water cs3k.com Given n non-negative integers representing an elevation m...
LeetCode 之水箱问题
coder 进阶的专栏
03-04 5612
1. Container with most water Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line
【一天一道LeetCode】#42. Trapping Rain Water
ZeeCoder
05-06 1513
#一天一道LeetCode系列（一）题目 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, Give
LeetCode刷题记录（第五天）
qq_26424543的博客
03-23 528
Trapping Rain Water原题目：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.翻译后：给定n个非负整数来表示每个柱的宽度为1的高程图...
接雨水 II-LintCode
kane的博客
09-25 1000
Given n x m non-negative integers representing an elevation map 2d where the area of each cell is 1 x 1, compute how much water it is able to trap after raining. 例如，给定一个 5*4 的矩阵：[ [12,13,0,12],
LeetCode 42: Trapping Rain Water题解（python）
Bourns_A的博客
07-15 533
Leetcode 42: Trapping Rain Water 分类：Stack (Monotonic Stack) 难度：Hard （H-/M+） 描述：给了一个整数数组，这个数组可以模拟成一个积水的槽。问这个水槽最大能积多少个单位面积的水 Input: [0,1,0,2,1,0,1,3,2,1,2,1] Output: 6 由此图示可见，有六个单位面积的蓝色，对应着六个单位面积的积水。 链接: Trapping Rain Walter. 思路： 此题主要思路是维护一个递减栈。当遇到一个不断递减的b
[LeetCode] Trapping Rain Water 三种方案 Python
新手村
07-25 823
Trapping Rain Water： 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,
leetcode答案-leetcode:leetcode.com问题的答案
06-30
leetcode 答案leetcode leetcode.com 问题的答案 跑步 python -m venv .venv source .venv/bin/activate pip install -r requirements.txt pytest <question>/tests.py ...python ...lc42_trapping_rain_water/tests.py
Leetcode:给定n个非负整数，表示一个直方图，其中每个矩形的宽度为1，计算它在雨后能够截留多少水。
LeetCode:Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum
06-17 1454
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], ret...
code第一部分：数组 第十四题 雨水问题
weixin_33845881的博客
02-25 104
code第一部分：数组 第十四题 雨水问题 Given n non-negative integers representing an elevation map where the width of each bar is 1, computehow much water it is able to trap after raining.For example, Given [0,1,0...
LintCode 364: Trapping Rain Water II (3维蓄水池问题，最小堆经典题)
roufoo的博客
02-03 535
Trapping Rain Water II Given n x m non-negative integers representing an elevation map 2d where the area of each cell is 1 x 1, compute how much water it is able to trap after raining. Example Given...
42. Trapping Rain Water
a1310368974的博客
01-25 148
在北京写一题，好爽 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
接雨水问题（C++)
HEY JUDE
12-08 2024
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,
Leetcode42 Trapping Rain Water
大洋深处
05-25 163
题目： 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. The above elevation map is represented by...
LeetCode 题解（14）:Trapping Rain Water
02-24 807
题目： 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
leetcode题解-42. Trapping Rain Water
呜呜哈的博客
06-07 1083
题目：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], r
leetcode 91: Trapping Rain Water
西施豆腐渣
03-01 910
Trapping Rain WaterMar 10 '12 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 e
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值