LeetCode OJ - 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!

分析：这题想了很多办法都有缺陷，最后参考 http://blog.csdn.net/pickless/article/details/9235161。利用了局部最大，全局最大组合起来求解。

class Solution {
public:
    int trap(int A[], int n) {
        int ret = 0;
        int maxId = 0;
        //找到最长的木板
        for(int i = 0; i < n; i++) {
            if(A[i] > A[maxId]) {
                maxId = i;
            }
        }
        
        //从左逼近
        int max = A[0];
        for(int i = 0; i < maxId; i++) {
            if(A[i] > max) {
                max = A[i];
            } else {
                ret += max - A[i];
            }
        }
        
        //从右逼近
        max = A[n - 1];
        for(int i = n - 1; i > maxId; i--) {
            if(A[i] > max) {
                max = A[i];
            } else {
                ret += max - A[i];
            }
        }
        
        return ret;
    }
};

当然求出每一个每一个元素左边的最大值、右边的最大值，并且与元素自身比较，也能得出结果：

class Solution {
public:
    int trap(int A[], int n) {
        if(A==NULL || n<1)return 0;
    	
		int maxheight = 0;
		vector<int> leftMostHeight(n);
		for(int i =0; i<n;i++)
		{
			leftMostHeight[i]=maxheight;
			maxheight = maxheight > A[i] ? maxheight : A[i];
		}

		maxheight = 0;
		vector<int> rightMostHeight(n);
		for(int i =n-1;i>=0;i--)
		{
			rightMostHeight[i] = maxheight;
			maxheight = maxheight > A[i] ? maxheight : A[i];
		}

		int water = 0;
		for(int i =0; i < n; i++)
		{
			int high = min(leftMostHeight[i],rightMostHeight[i])-A[i];
			if(high>0)
				water += high;
		}
		return water;
    }
};