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!
Subscribe to see which companies asked this question
分析:
//此解法的时间复杂度是O(n),只需要遍历一遍。空间复杂度是O(1) //思路是采用l和r两个指针,维护装水两边的位置。 //当l处高度低时,说明l右侧装的水肯定和l处一样高,此时逐步右移l,同是加上l处与右移后位置高度差(因为这里都能装水啊),直到再遇到同样 //高或者更高的位置。然后进行下一轮判断。 //同样,当r处高度低时,说明r左侧的水肯定和r处一样高,此时逐步左移r,同是加上r处与左移后位置高度差,直到再遇到同样高或者更高的位置。 //最后直到l和r相遇,结束。
ac代码:
class Solution {
public:
int trap(vector<int>& height) {
int L=height.size(),l=0,r=L-1,minn,ret=0;
while(l<r)
{
minn=min(height[l],height[r]);
if(height[l]==minn)
while(++l<r&&height[l]<minn)
ret+=minn-height[l];
else
while(--r>l&&height[r]<minn)
ret+=minn-height[r];
}
return ret;
}
};