day08:42. 接雨水

class Solution {
public:
    //思路：雨水面积 = 总面积（雨水 + 陆地）- 陆地面积
    //总面积 = 每层面积的和
    int trap(vector<int>& height) {
        int length = height.size();
        //剪枝，数组长度小于3时不可能接到雨水
        if(length < 3) return 0;
        int l = 0, r = length - 1;

        //定义前一次计算时的高度
        int preHeight = 0;
        //定义雨水 + 陆地的总面积
        int totalArea = 0;
        //定义陆地面积
        int landArea = 0;

        //显然总陆地面积为数组所有数求和
        landArea = accumulate(height.begin(), height.end(), 0);

        while(l < r) {
            //跳过小于等于前一次计算的值
            while(l < r && height[l] <= preHeight) l++;
            while(l < r && height[r] <= preHeight) r--;

            //计算当前高度的面积 = （当前左右指针中较小的值 - 前一次计算的高度）* 宽度
            totalArea += (min(height[l], height[r]) - preHeight) * (r - l + 1);
            //更新前一次的高度
            preHeight = min(height[l], height[r]);
        }

        return totalArea - landArea;
    }
};

// https://leetcode.cn/problems/trapping-rain-water/solutions/2206862/shuang-zhi-zhen-li-jie-qi-lai-bi-jiao-ji-bdis/

class Solution {
public:
    int trap(vector<int>& height) {
        int l_max = 0, r_max = 0;
        long int ans = 0;
        for (size_t i = 0; i < height.size(); ++i) {
            l_max = max(l_max, height[i]);
            r_max = max(r_max, height[height.size() - i - 1]);
            ans += l_max + r_max - height[i];
        }
        return ans - l_max * height.size();
    }
};


// https://leetcode.cn/problems/trapping-rain-water/solutions/2705550/python3liu-xing-dai-ma-tu-xing-yin-ying-wfduo?