Trapping Rain Water

最新推荐文章于 2024-10-15 19:28:18 发布

Dr-rong

最新推荐文章于 2024-10-15 19:28:18 发布

阅读量297

点赞数

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

本文链接：https://blog.csdn.net/durong123123123/article/details/42488535

版权

LeetCode 专栏收录该内容

137 篇文章 0 订阅

订阅专栏

class Solution {
public:
    int getArea(int upBound,int lowBound,int A[],int start,int end)
    {
        int res=0;
        for(int i=start;i<=end;++i)
        {
            if(A[i]>lowBound)
            {
                if(A[i]>upBound)
                {
                    res=res+upBound-lowBound;
                }
                else
                {
                    res=res+A[i]-lowBound;   
                }
            }
        }
        return res;
    }
    int trap(int A[], int n) {
        if(n<3)
        {
            return 0;
        }
        int wallArea=0;
        /*
        for(int i=0;i<n;++i)
        {
            wallArea+=A[i];
        }
        */
        int totalArea=0;
        int forward=0;
        int backward=n-1;
        int preheight=0;
        while(forward<backward)
        {
            if(A[forward]<A[backward])
            {
                totalArea+=(A[forward]-preheight)*(backward-forward+1);
                wallArea+=getArea(A[forward],preheight,A,forward,backward);
                preheight=A[forward];
                while((forward<backward)&&(A[forward]<=preheight))
                {
                    ++forward;
                }
            }
            else
            {
                totalArea+=(A[backward]-preheight)*(backward-forward+1);
                wallArea+=getArea(A[backward],preheight,A,forward,backward);
                preheight=A[backward];
                while((backward>forward)&&(A[backward]<=preheight))
                {
                    --backward;
                }
            }
        }
        return totalArea-wallArea;
    }
};

基本思想是，算出总的由墙围成的有效面积，然后再减去其中含有的墙的面积，就是剩下的所求面积。注意求有效面积时是从墙由低到高考虑的，不要考虑重复了。