接雨水python

最新推荐文章于 2025-01-12 22:06:08 发布

GuNing999999

最新推荐文章于 2025-01-12 22:06:08 发布

阅读量225

点赞数

CC 4.0 BY-SA版权

文章标签： python 开发语言后端

本文链接：https://blog.youkuaiyun.com/GuNing999999/article/details/121118200

本文介绍了一种高效的算法，用于计算二维高度地图中能收集多少雨水。通过优先队列记录边界高度，并逐步填充内部区域来实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

class Solution:
    def trapRainWater(self, heightMap: List[List[int]]) -> int:
        if len(heightMap) <= 2 or len(heightMap[0]) <= 2:
            return 0

        m, n = len(heightMap), len(heightMap[0])
        visited = [[0 for _ in range(n)] for _ in range(m)]
        pq = []
        for i in range(m):
            for j in range(n):
                if i == 0 or i == m - 1 or j == 0 or j == n - 1:
                    visited[i][j] = 1
                    heapq.heappush(pq, (heightMap[i][j], i * n + j))
        
        res = 0
        dirs = [-1, 0, 1, 0, -1]
        while pq:
            height, position = heapq.heappop(pq)
            for k in range(4):
                nx, ny = position // n + dirs[k], position % n + dirs[k + 1]
                if nx >= 0 and nx < m and ny >= 0 and ny < n and visited[nx][ny] == 0:
                    if height > heightMap[nx][ny]:
                        res += height - heightMap[nx][ny]
                    visited[nx][ny] = 1    
                    heapq.heappush(pq, (max(height, heightMap[nx][ny]), nx * n + ny))
        return res