[LeetCode]Trapping Rain Water

最新推荐文章于 2020-08-24 17:46:40 发布

BoilerHouseKing

最新推荐文章于 2020-08-24 17:46:40 发布

阅读量754

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： Java LeetCode

本文链接：https://blog.csdn.net/guorudi/article/details/39498087

LeetCode 专栏收录该内容

160 篇文章

订阅专栏

本文介绍了一种计算给定地形图中雨后积水体积的方法。通过预处理得到左右最高点信息，进而计算每个位置能容纳的最大水量，最终求和得出总的积水体积。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

For example,
Given [0,1,0,2,1,0,1,3,2,1,2,1], return 6.

The above elevation map is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped. Thanks Marcos for contributing this image!

参考：戴方勤 (soulmachine@gmail.com) https://github.com/soulmachine/leetcode

public class Solution {
    public int trap(int[] A) {
        int sum = 0;
    	int maxLeft [] = new int[A.length];
        int maxRight [] = new int [A.length];
        for(int i=1;i<A.length;i++){
        	maxLeft[i] = Math.max(maxLeft[i-1], A[i-1]);
        	maxRight[A.length-1-i] = Math.max(maxRight[A.length-i], A[A.length-i]);
        }
        for(int i=0;i<A.length;i++){
        	int height = Math.min(maxLeft[i],maxRight[i]);
        	if(height>=A[i]){
        		sum += height-A[i];
        	}
        }
        return sum;
    }
}