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.
样例
如上图所示,海拔分别为 [0,1,0,2,1,0,1,3,2,1,2,1]
, 返回 6
.
(1)找到最高高度
(2)左右两边分别向最高处逼近,计算第一个比当前高度高的位置距离,以及中间覆盖的低于当前高度的高度总和,用当前高度能盛的最大和减去内部高度和,等于雨水和
public class Solution {
/*
* @param heights: a list of integers
* @return: a integer
*/
public int trapRainWater(int[] heights) {
int n = heights.length;
int max=0;
int maxIndex=0;
for(int i=0; i<n; i++){
if(max<heights[i]){
max = Math.max(max, heights[i]);
maxIndex=i;
}
}
int i=0, j=1;
int vol=0;
while(j<=maxIndex){
int inner=0;
while(heights[i]>heights[j]){
inner+=heights[j++];
}
vol+=heights[i]*(j-i-1)-inner;
i=j++;
}
i=n-1; j=n-2;
while(j>=maxIndex){
int inner=0;
while(heights[i]>heights[j]){
inner+=heights[j--];
}
vol+=heights[i]*(i-j-1)-inner;
i=j--;
}
return vol;
}
}