# [Leetcode] 42. Trapping Rain Water 解题报告

168人阅读 评论(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!

class Solution {
public:
int trap(vector<int>& height) {
if(height.size() <= 2)
return 0;
int size = height.size();
vector<int> left(size, 0);
vector<int> right(size, 0);
for(int i = 1; i < size; ++i)
left[i] = max(left[i-1], height[i-1]);
for(int i = size - 2; i >= 0; --i)
right[i] = max(right[i+1], height[i+1]);
int sum = 0;
for(int i = 1; i < size - 1; ++i)
{
int min_height = min(left[i], right[i]);
sum += max(0, min_height - height[i]);
}
return sum;
}
};

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：76624次
• 积分：5530
• 等级：
• 排名：第5417名
• 原创：493篇
• 转载：10篇
• 译文：2篇
• 评论：17条
阅读排行
最新评论