42. Trapping Rain Water[hard]

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!

思考题

只要想通流水的规则就比较简单。

先假定加上水之后所有格子都跟最高的格子一样高，然后水会向两边流出（故从边缘到中心是非递减序列）

我的做法是：从某一恻开始，把格子加上水的高度设为之前遍历过的最高的格子的高度，。。然后假定多余水从另一侧流出。

class Solution {
public:
    int trap(vector<int>& height) {
        vector<int> a(height.size()+10 , 0);
        int MAX = 0;
        for(int i=height.size()-1;i>=0;--i)
        {
            if(MAX < height[i])
                MAX = height[i];
            a[i] = MAX;
        }
        MAX = 0;
        for(int i=0;i<height.size();++i)
        {
            if(MAX < height[i])
                MAX = height[i];
            if(a[i] > MAX)
                a[i] = MAX;
        }
        int ans = 0;
        for(int i=0;i<height.size();++i)
            ans += a[i] - height[i];
        return ans;
    }
};