Leetcode Problem 407. Trapping Rain Water II

407. Trapping Rain Water II

Leetcode Solutions

Initialize a priority queue (min-heap) to store cell information (height, row, column).
Add all boundary cells to the priority queue and mark them as visited.
Initialize a result variable to 0 to store the total volume of trapped water.
While the priority queue is not empty: a. Pop the cell with the lowest height from the priority queue. b. Check all unvisited neighbors of the current cell. c. If a neighbor can trap water (its height is less than the current cell's height), add the trapped water volume to the result. d. Add the neighbor to the priority queue with a height equal to the maximum of its own height and the current cell's height. e. Mark the neighbor as visited.
Return the result.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen