题目
给定 n 个非负整数表示每个宽度为 1 的柱子的高度图,计算按此排列的柱子,下雨之后能接多少雨水。
上面是由数组 [0,1,0,2,1,0,1,3,2,1,2,1] 表示的高度图,在这种情况下,可以接 6 个单位的雨水(蓝色部分表示雨水)。 感谢 Marcos 贡献此图。
示例:
输入: [0,1,0,2,1,0,1,3,2,1,2,1] 输出: 6
分析
解法参考:https://leetcode-cn.com/problems/trapping-rain-water/solution/jie-yu-shui-by-leetcode/
class Solution {
public int trap(int[] height) {
int[] maxL = new int[height.length];
int[] maxR = new int[height.length];
int re = 0;
int tem = 0;
for (int i = 0; i < height.length; i++) {
maxL[i] = Math.max(tem,height[i]);
tem = maxL[i];
}
tem = 0;
for (int i = height.length-1; i >=0 ; i--) {
maxR[i] = Math.max(tem,height[i]);
tem = maxR[i];
}
for (int i = 0; i < height.length; i++) {
re += Math.min(maxL[i],maxR[i])-height[i];
}
return re;
}
}