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.

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的顶上的水量就取决于min(左边最大值，右边最大值)-当前值。

源码：

class Solution {
public:
	int trap(vector<int>& height) {
        if(height.empty())  return 0;
        int N = height.size();
        vector<int> left_max(N), right_max(N);
        left_max[0] = height[0];
        for(int i=1; i<N; i++){
            left_max[i] = max(height[i], left_max[i - 1]);
        }
        right_max[N-1] = height[N-1];
        for(int i=N-2; i>=0; i--){
            right_max[i] = max(height[i], right_max[i + 1]);
        }
        int res = 0;
        for(int i=1; i<N-1; i++){
            res += min(left_max[i], right_max[i]) - height[i];
        }
        return res;
	}
};