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!
题意
如图,一个数组元素代表每个条形图的高度,每个条形图宽度为1.求条形图能装水的面积。
题解
从最高点把图分为两部分,左边部分先从头开始找到第一个非0点top,然后减去后面小的数,得到积水量。如果遇到比top大的数,那么找到下一个最高点,更新top的值,然后继续减去后面小的数,直到再遇到更高的数。
右边部分,从尾开始找第一个非0点top,每遇到一个比top值大的数,则更新top值,遇到比top小的数,则相减得到积水量。
class Solution {
public:
int trap(vector<int>& height) {
int highest=0;
int water=0;
for(int i=0;i!=height.size();i++)
if(height[i]>height[highest]) highest=i;
for(int i=0,top=0;i<highest;i++)
{
if(height[i] > top) top=height[i];
else water+=top-height[i];
}
for(int i=height.size()-1,top=0;i>highest;i--)
{
if(height[i] > top) top=height[i];
else water+=top-height[i];
}
return water;
}
};