# LeetCode 42 Trapping Rain Water

341人阅读 评论(0)

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!

public class Solution {
public int trap(int[] height) {
int maxHeight = 0, len = height.length, pos = 0;
for(int i = 0; i < len; i ++) {
if(maxHeight < height[i]) {
pos = i;
maxHeight = height[i];
}
}
int ans = 0;
int curMax = 0, curArea = 0;
for(int i = 0; i < pos; i ++) {
if(height[i] > curMax) {
curMax = height[i];
}
else {
curArea += curMax - height[i];
}
}
ans += curArea;
curMax = 0;
curArea = 0;
for(int i = len - 1; i > pos; i --) {
if(height[i] > curMax) {
curMax = height[i];
}
else {
curArea += curMax - height[i];
}
}
ans += curArea;
return ans;
}
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：570893次
• 积分：13447
• 等级：
• 排名：第955名
• 原创：800篇
• 转载：7篇
• 译文：0篇
• 评论：119条
博客专栏
 LeetCode 文章：126篇 阅读：53494
 Java学习笔记 文章：10篇 阅读：5725
 算法题 文章：47篇 阅读：23949
阅读排行