问题描述：
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...
分类：
移动开发 时间：
2014-11-24 20:55:26
阅读次数：
196
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....
分类：
移动开发 时间：
2014-11-15 07:47:26
阅读次数：
242
题目描述：
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...
分类：
移动开发 时间：
2014-11-06 13:06:41
阅读次数：
239
Givennnon-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.Fo...
分类：
移动开发 时间：
2014-10-30 01:41:48
阅读次数：
169
使用栈结构解决。#include #include using namespace std;class Solution {public: int trap(int A[], int n) { if (n water_stack; int begin=0; ...
分类：
移动开发 时间：
2014-10-29 12:12:50
阅读次数：
184
https://oj.leetcode.com/problems/trapping-rain-water/Trapping Rain WaterGiven n non-negative integers representing an elevation map where the width of...
分类：
移动开发 时间：
2014-10-28 19:54:55
阅读次数：
213
题目：Givennnon-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...
分类：
移动开发 时间：
2014-10-27 01:44:33
阅读次数：
231
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]...
分类：
移动开发 时间：
2014-10-26 14:26:31
阅读次数：
187
Givennnon-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.Fo...
分类：
移动开发 时间：
2014-10-25 07:04:38
阅读次数：
181
[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....
分类：
移动开发 时间：
2014-10-22 10:05:30
阅读次数：
248
