LeetCode - Trapping Rain Water 等雨水的凹槽容量

最新推荐文章于 2020-10-19 15:58:02 发布

disappearedgod

最新推荐文章于 2020-10-19 15:58:02 发布

阅读量978

点赞数

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

本文链接：https://blog.csdn.net/disappearedgod/article/details/37510665

版权

LeetCode 专栏收录该内容

94 篇文章 0 订阅

订阅专栏

作者：disappearedgod
文章出处：http://blog.csdn.net/disappearedgod/article/details/37510665

时间：2014-7-7

题目

Trapping Rain Water

Total Accepted: 11100 Total Submissions: 39417 My Submissions

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!

解法

解法一：

靖心的博客中已经详细分析了这道题的意思。

我的想法是：

数学解法是先算一个规则图形（凸包图形），然后再在图形上减去这个已有数组的值。

进一步想一下：我们的凸包只是长方形，而不可能计算梯形面积，而长方形其实是在“宽”的基础上对长的积分而已；而积分的同时可以进一步做减法。

public class Solution {
    public int trap(int[] A) {
        int Height = 0;
        int left = 0;
        int right = A.length - 1;
        int area = 0;
        while(left < right){
            if(A[left] < A[right]){
                Height = Math.max(Height,A[left]);
                area +=Height - A[left];
                left++;
            }
            else{
                Height = Math.max(Height,A[right]);
                area += Height - A[right];
                right--;
            }
        }
        return area;
    }
}