LeetCode 42. Trapping Rain Water

ncst

于 2018-04-10 19:26:10 发布

阅读量358

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/sinat_32547403/article/details/79886196

版权

leetcode 专栏收录该内容

414 篇文章

订阅专栏

本文介绍了一种使用O(n)时间复杂度计算给定地形图中雨水能够积累的最大体积的方法。通过一次遍历找到最高柱并分段计算左右两侧积水总量。

摘要生成于 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!

使用O(n)的时间复杂度进行处理

java

class Solution {
    public int trap(int[] arr) {
        if (arr == null || arr.length == 0) {
            return 0;
        }
        int mid = 0, len = 0;
        for (int i = 0; i < arr.length; i++) {
            if (arr[i] > len) {
                len = arr[i];
                mid = i;
            }
        }
        int res = 0, cur = 0;
        for (int i = 0; i < mid; i++) {
            if (cur < arr[i]) {
                cur = arr[i];
            } else {
                res += cur - arr[i];
            }
        }
        cur = 0;
        for (int i = arr.length - 1; i > mid; i--) {
            if (cur < arr[i]) {
                cur = arr[i];
            } else {
                res += cur - arr[i];
            }
        }
        return res;
    }
}