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.
[图片上传失败...(image-316878-1513739682352)]
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 Marcosfor contributing this image!
题目：Given n non-negative integers representing an elevatio...
Description: Given n non-negative integers representing a...
https://leetcode.com/problems/trapping-rain-water/descrip...
https://leetcode-cn.com/problems/trapping-rain-water-ii/
题目描述： https://leetcode.com/problems/trapping-rain-water/ ...
题目：https://leetcode-cn.com/problems/trapping-rain-water/[...
题目链接 https://leetcode-cn.com/problems/trapping-rain-water...
https://leetcode.com/problems/trapping-rain-water/ My sol...
https://leetcode-cn.com/problems/trapping-rain-water/[htt...
题目Given n non-negative integers representing an elevation...
本文标题：Trapping Rain Water解题报告
本文链接：https://www.haomeiwen.com/subject/daxgwxtx.html
网友评论