题目描述： 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 ra ...
分类：
移动开发 时间：
2017-07-12 13:55:08
阅读次数：
250
https://leetcode.com/problems/trapping-rain-water/#/solutions Here is my idea: instead of calculating area by height*width, we can think it in a cumul ...
分类：
移动开发 时间：
2017-07-04 13:21:11
阅读次数：
144
题意： 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 rain ...
分类：
移动开发 时间：
2017-06-23 22:05:23
阅读次数：
215
题目： 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 ...
分类：
移动开发 时间：
2017-06-22 21:47:12
阅读次数：
276
https://leetcode.com/problems/trapping-rain-water-ii/ 参考：http://www.cnblogs.com/grandyang/p/5928987.html ...
分类：
移动开发 时间：
2017-06-11 15:42:13
阅读次数：
280
题目 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 raini ...
分类：
移动开发 时间：
2017-06-07 10:17:44
阅读次数：
180
https://leetcode.com/problems/trapping-rain-water/ 思路一：参考 84. Largest Rectangle in Histogram，用 stack 做辅助 思路二：dynamic programming ...
分类：
移动开发 时间：
2017-06-02 17:23:41
阅读次数：
178
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 ...
分类：
移动开发 时间：
2017-04-25 16:41:10
阅读次数：
194
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. ...
分类：
移动开发 时间：
2017-04-21 18:48:56
阅读次数：
247
题目： 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 rain ...
分类：
移动开发 时间：
2017-04-17 22:12:15
阅读次数：
261
