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

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!

最基础的思路是，每一个i所对应容易能够装下的水量取决于其左右两边的高度，即volume[i] = [min(left[i], right[i]) - A[i]] * 1，这里的1是宽度。所以可以利用两个数组，一个用来记录每个位置左边的最大高度，另一个用来记录每个位置右边的最大高度，然后从头到尾遍历一遍计算每个位置可以容纳的水量。

    public int trap(int[] A) {
        if (A == null || A.length <= 2)
            return 0;
        
        int max, i, vol, n = A.length;
        int[] left = new int[n];
        int[] right = new int[n];
        
        for (i = 1, left[0] = A[0], max = A[0]; i < n; i++) {
            if (A[i] < max) {
                left[i] = max;
            } else {
                left[i] = A[i];
                max = A[i];
            }
        }
        
        for (i = n - 1, right[n - 1] = A[n - 1], max = A[n - 1]; i >= 0; i--) {
            if (A[i] < max) {
                right[i] = max;
            } else {
                right[i] = A[i];
                max = A[i];
            }
        }
        
        for (vol = 0, i = 1; i < n - 1; i++) {
            vol += Math.min(left[i], right[i]) - A[i];
        }
        
        return vol;
    }