力扣1765. 地图中的最高点（#Day23）

from collections import deque
from typing import List


def highestPeak(isWater: List[List[int]]) -> List[List[int]]:
    m, n = len(isWater), len(isWater[0])
    # 初始化高度-1为陆地，0为水域
    res = [[-1 for water in row] for row in isWater]
    q = deque()
    for i, row in enumerate(isWater):
        for j, water in enumerate(row):
            if water == 1:
                q.append((i, j))
                res[i][j] = 0
    while q:
        i, j = q.popleft()  # 从队头取出坐标
        for x, y in ((i-1, j), (i+1, j), (i, j-1), (i, j+1)):  # 遍历周围的陆地
            if 0 <= x < m and 0 <= y < n and res[x][y] == -1:  # 如果没有越界，陆地也没有被更新过则高度加1
                res[x][y] = res[i][j] + 1
                q.append((x, y))
    return res


isWater = [[0, 0, 1], [1, 0, 0], [0, 0, 0]]
print(highestPeak(isWater))  # [[1, 1, 0], [0, 1, 1], [1, 2, 2]]