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]

思路：每个位置能存储雨水的数量取决于它左右bar的最高高度和它本身的高度。

程序：

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