trapping_rain_water

README

< Previous 　　　　　　　　　　　　　　　　 Next >

42. Trapping Rain Water (Hard)

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. Thanks Marcos for contributing this image!

Example:

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

Related Topics

[Stack] [Array] [Two Pointers]

Similar Questions

1. Container With Most Water (Medium)
2. Product of Array Except Self (Medium)
3. Trapping Rain Water II (Hard)
4. Pour Water (Medium)