[Leetcode] Trapping Rain Water

标签：http   io   os   ar   for   sp   on   cti   amp   

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!

[Leetcode] Trapping Rain Water

标签：http   io   os   ar   for   sp   on   cti   amp   

原文地址：http://www.cnblogs.com/Phoebe815/p/4049640.html