Class Solution

java.lang.Object
g0401_0500.s0407_trapping_rain_water_ii.Solution

public class Solution extends Object
407 - Trapping Rain Water II.<p>Hard</p> <p>Given an <code>m x n</code> integer matrix <code>heightMap</code> representing the height of each unit cell in a 2D elevation map, return <em>the volume of water it can trap after raining</em>.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/04/08/trap1-3d.jpg" alt="" /></p> <p><strong>Input:</strong> heightMap = [[1,4,3,1,3,2],[3,2,1,3,2,4],[2,3,3,2,3,1]]</p> <p><strong>Output:</strong> 4</p> <p><strong>Explanation:</strong></p> <pre><code> After the rain, water is trapped between the blocks. We have two small ponds 1 and 3 units trapped. The total volume of water trapped is 4. </code></pre> <p><strong>Example 2:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/04/08/trap2-3d.jpg" alt="" /></p> <p><strong>Input:</strong> heightMap = [[3,3,3,3,3],[3,2,2,2,3],[3,2,1,2,3],[3,2,2,2,3],[3,3,3,3,3]]</p> <p><strong>Output:</strong> 10</p> <p><strong>Constraints:</strong></p> <ul> <li><code>m == heightMap.length</code></li> <li><code>n == heightMap[i].length</code></li> <li><code>1 <= m, n <= 200</code></li> <li><code>0 <= heightMap[i][j] <= 2 * 10<sup>4</sup></code></li> </ul>
  • Constructor Details

    • Solution

      public Solution()
  • Method Details

    • trapRainWater

      public int trapRainWater(int[][] heightMap)