leetcode刷题，总结，记录，备忘42

leetcode刷题，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.

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!

一开始被图片给误导了，以为只要找两两对应的高点算出其中的值就可以了，可是并没排除，2个高点中间又存在2个高点的情况，比如 5，0，1，2，1，4这种情况。所以应该换种思路，先找出最高点，然后从两边开始向中间遍历，找出每个临时的第二高点，途中所有的低于该高点的低点都可以计算雨水面积，依次直到最高点。

class Solution {
public:
    int trap(vector<int>& height) {
        if (height.size() == 0)
        {
            return 0;
        }
        
        int sum = 0;
        int max = 0;
        int maxindex = 0;
        
        for (int i = 0; i < height.size(); ++i)
        {
            if (height[i] > max)
            {
                max = height[i];
                maxindex = i;
            }
        }
        
        int secondheight = 0;
        for (int i = 0; i < maxindex; ++i)
        {
            if (height[i] <= height[secondheight])
            {
                sum += height[secondheight] - height[i];
            }
            else
            {
                secondheight = i;
            }
        }
        
        secondheight = height.size() - 1;
        for (int i = height.size() - 1; i > maxindex; --i)
        {
            if (height[i] <= height[secondheight])
            {
                sum += height[secondheight] - height[i];
            }
            else
            {
                secondheight = i;
            }
        }
        
        return sum;
    }
};