[leetcode][array] 42. Trapping Rain Water

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

Example:

Input: [0,1,0,2,1,0,1,3,2,1,2,1]
Output: 6

题意：相当于给出一个水槽的二维表示，求最多能装多少单位的水。

思路：水能装在槽里当且仅当水的高度小于等于它左右边界高度的最小值

题解：在没有得到边界值的，边界高度最小值为0，设为level = 0，此时扫描左右边界，每次扫描选择边界最小值minh，更新边界level = min(level, minh)，此时比较边界值是否等于minh，不等证明可以在此位置装水，进行ans += level - minh，最后将低边界的坐标往中间移动，直至左右坐标重合。

代码（python实现）：

class Solution:
    def trap(self, height):
        """
        :type height: List[int]
        :rtype: int
        """
        l = len(height)
        if l < 3:
            return 0
        ans = 0
        i = 0
        j = l - 1
        level = 0
        while i < j:
            if height[i] < height[j]:
                level = max(height[i], level)
                ans += level - height[i]
                i = i + 1
            else:
                level = max(height[j], level)
                ans += level - height[j]
                j = j - 1
        return ans

附AC情况：