[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.

基本思路是维护一个数组maxHeight，进行两次扫描，一次从左往右，一次从右往左~第一次扫描的时候维护每一个bar左边最大的高度，存入数组中，第二次扫描的时候维护右边最大的高度，并且将左边和右边较小的最大高度存入数组对应元素中~这样两遍扫描之后就可以得到每一个bar能承受的最大水量，从而累加得出结果。这个方法时间复杂度是O(2*n)=O(n)；空间上复杂度也是O(n)~

class Solution:
    # @param A, a list of integers
    # @return an integer
    def trap(self, A):
        if A is None or len(A) <= 1: return 0
        maxVal, res = 0, 0
        maxHeight = []
        for i in xrange(len(A)):
            maxHeight.append(maxVal)
            maxVal = max(maxVal, A[i])
        maxVal = 0
        for i in xrange(len(A) - 1, -1, -1):
            maxHeight[i] = min(maxHeight[i], maxVal)
            maxVal = max(maxVal, A[i])
            res += maxHeight[i] - A[i] if maxHeight[i] > A[i] else 0
        return res

还有一种更优化的解法，只需要一次扫描，但是不太好理解，具体思路参考http://blog.csdn.net/linhuanmars/article/details/20888505

class Solution:
    # @param A, a list of integers
    # @return an integer
    def trap(self, A):
        if A is None or len(A) <= 1: return 0
        l, r = 0, len(A) - 1
        res, minHeight = 0, 0
        while l < r:
            minHeight = min(A[l], A[r])
            if A[l] == minHeight:
                l += 1
                while l < r and A[l] < minHeight:
                    res += minHeight - A[l]
                    l += 1
            else:
                r -=1
                while l < r and A[r] < minHeight:
                    res += minHeight - A[r]
                    r -= 1
        return res