Skip to content

problem11.md

Latest commit

 

History

History
20 lines (15 loc) · 588 Bytes

problem11.md

File metadata and controls

20 lines (15 loc) · 588 Bytes

Problem 11: Reservoir Capacity

Problem Statement

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

Input Format

  • An array of integers height.

Output Format

  • An integer representing the total amount of trapped water.

Constraints

  • n == height.length
  • 1 <= n <= 2 * 10^4
  • 0 <= height[i] <= 10^5

Example

Input: height = [0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1]
Output: 6
Explanation: The elevation map [0,1,0,2,1,0,1,3,2,1,2,1] can trap 6 units of water.