Trapping Rain Water(计算积水量)

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

/* 计算能积多少水
 * 遍历一边找到最大值所在位置
 * 1. 从左遍历 记录当前极大高度hmax  和当前高度h
 *    然后当前积水量 += hmax-h
 * 这样进行两趟完整的遍历即可
 * */
class Solution {
public:
    int trap(vector<int>& height) {
        int water=0, maxidx=0, maxheight=-1, len=height.size();
        if(len==0 || len==1)  return 0;
        for(int i=0;i<len;i++){
            if(height[i]>maxheight){
                maxheight = height[i];
                maxidx = i;
            }
        }
        int hmax=height[0];
        for(int i=0;i<maxidx;i++){
            // 这两句不能颠倒！！ 先计算得到积水量 再更新局部最大值
            if(hmax-height[i]>0)    water += hmax-height[i];
            hmax = max(hmax, height[i]);

        }
        hmax = height[len-1];
        for(int j=len-1;j>maxidx;j--){
            if(hmax-height[j]>0)    water += hmax-height[j];
            hmax = max(hmax, height[j]);
        }
        return water;
    }
};