
[LeetCode] 1765. Map of Highest Peak (Python)
·
알고리즘/LeetCode
난이도: Medium문제 설명You are given an integer matrix isWater of size m x n that represents a map of land and water cells.If isWater[i][j] == 0, cell (i, j) is a land cell.If isWater[i][j] == 1, cell (i, j) is a water cell.You must assign each cell a height in a way that follows these rules:The height of each cell must be non-negative.If the cell is a water cell, its height must be 0.Any two adjacent ..