leetcode--Trapping Rain Water
来源:互联网 发布:淘宝客服岗位说明 编辑:程序博客网 时间:2024/06/11 14:19
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!
题意:如图,数组中的数字代表黑色柱子的高度,如果下了一场雨,求这些柱子可以乘多少水?(蓝色的就是水)
分类:数组,双指针
解法1:首先找到最高的,然后从左往最高处扫,碰到一个数A[i],计算A[0,,,i-1]最高的是否高过A[i],如果是,则A[i]上的水的体积为max(A[0...i-1])-A[i],否则为0并且更新最大值
从右往最高处再同样扫一遍
原文链接http://blog.csdn.net/crazy__chen/article/details/45749451
阅读全文
0 0
- LeetCode: Trapping Rain Water
- LeetCode : Trapping Rain Water
- [LeetCode] Trapping Rain Water
- [Leetcode] Trapping Rain Water
- [Leetcode] Trapping Rain Water
- [LeetCode]Trapping Rain Water
- LeetCode-Trapping Rain Water
- [leetcode] Trapping Rain Water
- [LeetCode] Trapping rain water
- Leetcode: Trapping Rain Water
- Leetcode:Trapping Rain Water
- [LeetCode] Trapping Rain Water
- <Leetcode>Trapping Rain Water
- Leetcode Trapping Rain Water
- leetcode Trapping Rain Water
- leetcode Trapping Rain Water
- LeetCode Trapping Rain Water
- LeetCode | Trapping Rain Water
- The processing instruction target matching "[xX][mM][lL]" is not allowed.错误
- Cascading——针对Hadoop MapReduce的数据处理API
- 【Idea】——非Maven项目导入jar包
- 并查集知识图解
- mapreduce实现ItemCF——基于物品的协同过滤
- leetcode--Trapping Rain Water
- 多线程并发
- 如何在window下搭建tensorflow开发环境
- java学习资源
- RecyclerView刷新布局时Glide加载图片闪现
- 【怎样写代码】对象克隆 -- 原型模式(五):原型管理器的引入和实现
- 二维数组遍历最佳方法
- 51nod 1050 循环数组最大子段和
- UVA