题目描述
给定 n 个非负整数表示每个宽度为 1 的柱子的高度图,计算按此排列的柱子,下雨之后能接多少雨水。
示例:
输入: [0,1,0,2,1,0,1,3,2,1,2,1]
输出: 6
解题思路
1、先找个数组最大值的索引值,以此为基点。
2、分别从最左边和最右边往基点遍历,如果下一个数比当前数小,既可以接水
代码
class Solution {
public int trap(int[] height) {
if(height.length < 3) return 0;
int tallest = 0;
for(int i = 1; i < height.length; i++){
if(height[tallest] < height[i]) tallest = i;
}
int water = 0;
for(int i = 0, tall = 0; i < tallest; i++){
if(tall < height[i]) tall = height[i];
else water += tall - height[i];
}
for(int i = height.length - 1, tall = 0; i > tallest; i--){
if(tall < height[i]) tall = height[i];
else water += tall - height[i];
}
return water;
}
}
参考:https://leetcode.com/problems/trapping-rain-water/discuss/17357/Sharing-my-simple-c%2B%2B-code%3A-O(n)-time-O(1)-space