leetcode 42 trapping rain water

42. Trapping Rain Water

Hard

306954FavoriteShare

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.

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!

Example:

Input: [0,1,0,2,1,0,1,3,2,1,2,1]
Output: 6

思路：

对于每个点的蓄水量应该看其两边的最高边界，所以第一次遍历求每个位置i左边的最高边界，第二次求右边的最高边界，取两者最小值，如果位置i的高度小于两边边界的较小值，则两者的差则为位置i蓄水量。

#include<algorithm>
class Solution {
public:
    int trap(vector<int>& height) {
        int water_storage=0;
        int n = height.size();
        int mx = 0;
        vector<int> dp(n,0);
        for(int i=0;i<n;i++)
        {
            dp[i] = mx;
            mx = max(mx,height[i]);
        }
        mx = 0;
        for(int i = n-1;i>=0;i--)
        {
            dp[i] = min(dp[i],mx);
            mx = max(mx,height[i]);
            if(dp[i]>height[i]) water_storage += dp[i] - height[i]; 
        }
        return water_storage;
    }
};

class Solution {
public:
    int trap(vector<int>& height) 
    {
        int n = height.size() ;
        if(n == 0) return 0 ;
        vector<int> dp(n , 0) ;
        dp[0] = height[0] ;//要看height是否非空
        int res = 0 ;
        for(int i = 1 ; i < n ; ++i)
        {
            dp[i] = max(height[i] , dp[i - 1]) ;
        }
        
        int mx = height[n - 1] ;
        for(int i = n - 2 ; i >= 1 ; --i)
        {
            mx = max(height[i] , mx) ;
            int mxmi = min(dp[i] , mx) ;
            if(mxmi > height[i]) res += mxmi - height[i] ;
        }
        
        return res ;
    }
};