题目链接:https://leetcode.cn/problems/trapping-rain-water/
题目大意
给定 n n n个非负整数表示每个宽度为1的柱子的高度图,计算按此排列的柱子,下雨之后能接多少雨水。
思路
对于下标 i i i,下雨后水能达到的最大高度等于 h e i g h t [ i ] height[i] height[i]左右两边最大值的最小值减去 h e i g h t [ i ] height[i] height[i]。
设 l e f t [ i ] left[i] left[i]表示 h e i g h t [ 0 i ] height[0~i] height[0 i]的最大值,有如下递推关系:
l e f t [ i ] = { h e i g h t [ 0 ] , i = = 0 m a x ( l e f t [ i − 1 ] , h e i g h t [ i ] ) , i > 0 left[i] = \begin{cases} height[0],\,\,i==0\\ max(left[i-1], height[i]),\,\,i>0\\ \end{cases} left[i]={height[0],i==0max(left[i−1],height[i]),i>0
类似地,设 r i g h t [ i ] right[i] right[i]表示 h e i g h t [ i l e n − 1 ] height[i~len-1] height[i len−1]的最大值,有如下递推关系:
r i g h t [ i ] = { h e i g h t [ h e i g h t . l e n g t h − 1 ] , i = = h e i g h t . l e n g t h − 1 m a x ( r i g h t [ i + 1 ] , h e i g h t [ i ] ) , i < h e i g h t . l e n g t h − 1 right[i] = \begin{cases} height[height.length-1],\,\,i==height.length-1\\ max(right[i+1], height[i]),\,\,i<height.length-1\\ \end{cases} right[i]={height[height.length−1],i==height.length−1max(right[i+1],height[i]),i<height.length−1
求出 l e f t left left和 r i g h t right right数组后,下标 i i i处的雨水量为 m i n ( l e f t [ i ] , r i g h t [ i ] ) − h e i g h t [ i ] min(left[i], right[i])-height[i] min(left[i],right[i])−height[i],将所有下标的雨水量加起来即可得到雨水总量。
解法
Java
public int trap(int[] height) {
// left[i]表示height[0~i]最高元素的高度
int[] left = new int[height.length];
left[0] = height[0];
for (int i = 1; i < height.length; i++) {
left[i] = Math.max(left[i - 1], height[i]);
}
// right[i]表示height[i~len-1]最高元素的高度
int[] right = new int[height.length];
right[height.length - 1] = height[height.length - 1];
for (int i = height.length - 2; i >= 0; i--) {
right[i] = Math.max(right[i + 1], height[i]);
}
int result = 0;
for (int i = 0; i < height.length; i++) {
result += Math.min(left[i], right[i]) - height[i];
}
return result;
}
Go
func trap(height []int) int {
max := func(a, b int) int {
if a > b {
return a
}
return b
}
min := func(a, b int) int {
if a < b {
return a
}
return b
}
// left[i]表示height[:i]最高元素的高度
left := make([]int, len(height))
left[0] = height[0]
for i := 1; i < len(height); i++ {
left[i] = max(height[i], left[i-1])
}
// right[i]表示height[i:]最高元素的高度
right := make([]int, len(height))
right[len(height)-1] = height[len(height)-1]
for i := len(height) - 2; i >= 0; i-- {
right[i] = max(height[i], right[i+1])
}
result := 0
for i := 0; i < len(height); i++ {
result += min(left[i], right[i]) - height[i]
}
return result
}