Leetcode 42: 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!

上述即是原题，本文讲诉的方法主要是通过计算出高度最大的点，然后分别遍历该点的左边和右边，如从key（最大值点）开始往左，如果遍历到Ai点，如果max(A0...i-1)<=Ai,则AI点上的雨水为0，反之Ai上的雨水为max(A0...i-1)-Ai,同理可计算右边的雨水数，下面是AC代码；

class Solution {
public:
    int trap(vector<int>& height) {
    if(height.size() < 3) return 0;
int max=height[0],key=0,answer=0;
int m = height.size();

for(int i=0;i<m;i++)
{
if(height[i] > max)
{
max = height[i];
key = i;
}
}
int j=key-1;
while(j>=0)
{
int mid = *max_element(height.begin(),height.begin()+j);
if(mid > height[j])
{
answer += mid - height[j];
}
j--;
}
int k = key +1;
while(k<m)
{
int mid = *max_element(height.begin()+k,height.end());
if(mid > height[k])
{
answer += mid-height[k];
}
k++;
}
return answer;     
    }
};