[Leetcode] Trapping Rain Water

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

leo524891010

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

阅读量545

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode

本文链接：https://blog.youkuaiyun.com/algorithmengine/article/details/8570533

Leetcode 专栏收录该内容

135 篇文章

订阅专栏

本文介绍了一种用于计算二维高度图中能捕获多少雨水的算法。通过预先计算每个位置左侧和右侧的最大高度，该算法有效地确定了每个位置可以捕获的雨水量。

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

class Solution {
public:
    int trap(int A[], int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<int> height(n);
        
        for (int i = 0; i < n; ++i)
        {
            height.push_back(A[i]);
        }
        
        int maxHeight = 0;
        vector<int> leftArr(height.size());
        
        for (int i = 0; i < height.size(); ++i)
        {
            leftArr[i] = maxHeight;
            if (height[i] > maxHeight)
                maxHeight = height[i];
        }
        
        maxHeight = 0;
        vector<int> rightArr(height.size());
        for (int i = height.size() - 1; i >= 0; --i)
        {
            rightArr[i] = maxHeight;
            if (height[i] > maxHeight)
                maxHeight = height[i];
        }
        
        int water = 0;
        for (int i = 0; i < height.size(); ++i)
        {
            int temp = min(leftArr[i], rightArr[i]) - height[i];
            
            if (temp > 0)
                water += temp;
        }
        
        return water;
    }
};