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

参考：戴方勤 ([e-mail])     https://github.com/soulmachine/leetcode

public class Solution {    public int trap(int[] A) {        int sum = 0;    int maxLeft [] = new int[A.length];        int maxRight [] = new int [A.length];        for(int i=1;i<A.length;i++){        maxLeft[i] = Math.max(maxLeft[i-1], A[i-1]);        maxRight[A.length-1-i] = Math.max(maxRight[A.length-i], A[A.length-i]);        }        for(int i=0;i<A.length;i++){        int height = Math.min(maxLeft[i],maxRight[i]);        if(height>=A[i]){        sum += height-A[i];        }        }        return sum;    }}