Skip to content

Latest commit

 

History

History
38 lines (22 loc) · 1.02 KB

0042-trapping-rain-water.adoc

File metadata and controls

38 lines (22 loc) · 1.02 KB

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.

rainwatertrap

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!

Example:

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

解题分析

有点懵逼,没看太明白。

link:{sourcedir}/_0042_TrappingRainWater.java[role=include]

思考题

尝试一下动态规划解法!