思路:
1.从头到尾遍历数组,找出每一个位置能接的最多雨水,累加起来
2.每个位置:找出左边右边最高的,然后从左右最高的中找出最低的,最后用这个最低的减去每个位置的值,就是每个位置能装的水
代码:
class Solution {
public int trap(int[] height) {
int sum = 0;
for (int i = 1; i < height.length - 1; i++) {
int max_left = 0;
for (int j = i - 1; j >= 0; j--) {
if (height[j] > max_left) {
max_left = height[j];
}
}
int max_right = 0;
for (int j = i + 1; j < height.length; j++) {
if (height[j] > max_right) {
max_right = height[j];
}
}
int min = Math.min(max_right, max_left);
if (min >= height[i]) {
sum = sum + (min - height[i]);
}
}
return sum;
}
}