LeetCode 42. 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.
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!
Example:
Input: [0,1,0,2,1,0,1,3,2,1,2,1]
Output: 6
想法题:能存水则需要两个边界,一个边界柱是height[l]\height[r]中高的一个,另一个边界柱是maxh.
class Solution {
public:
int trap(vector<int>& height) {
int maxh = 0, result = 0, l = 0, r = height.size()-1;
while(l<=r){
int lower = height[height[l]<height[r]?l++:r--];
maxh = max(maxh,lower);
result+=maxh-lower;
}
return result;
}
};