[leetcode] Trapping Rain Water
2014-12-20 16:32
417 查看
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,0,2,1,0,1,3,2,1,2,1], return
6.
class Solution {
public:
int trap(int A[], int n) {
int res = 0;
int maxIndex = 0;
for(int i=1;i<n;i++)
if(A[i]>A[maxIndex])
maxIndex = i;
int maxCur = A[0];
for(int i=1;i<maxIndex;i++) {
if(A[i]<maxCur)
res += maxCur-A[i];
else
maxCur = A[i];
}
maxCur = A[n-1];
for(int i=n-2;i>maxIndex;i--) {
if(A[i]<maxCur)
res += maxCur-A[i];
else
maxCur = A[i];
}
return res;
}
};View Code
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 42: Trapping Rain Water
- [leetcode]Trapping Rain Water @ Python
- Trapping Rain Water--LeetCode
- leetcode----Trapping Rain Water
- leetcode Trapping Rain Water
- LeetCode 第四十二题（Trapping Rain Water） Java
- [LeetCode] 407. Trapping Rain Water II 收集雨水 II
- LeetCode(42) Trapping Rain Water
- 【LeetCode】Trapping Rain Water
- Leetcode 407. Trapping Rain Water II 收集雨水2 解题报告
- LeetCode—Trapping Rain Water 储水问题，从两边向中间
- [LeetCode][Java] Trapping Rain Water
- LeetCode Trapping Rain Water
- Leetcode: Trapping Rain Water
- leetcode 407. Trapping Rain Water II
- [LeetCode] Trapping Rain Water
- [Leetcode 42] Trapping Rain Water
- 【leetcode】Array——Trapping Rain Water（42）
- Leetcode Trapping Rain Water
- LeetCode 42 Trapping Rain Water