2023.02.10 Today's Challenge

https://leetcode.com/problems/as-far-from-land-as-possible/

As Far from Land as Possible - LeetCode

BFS로 풀면 되는 문제!

class Solution:
    def maxDistance(self, grid: List[List[int]]) -> int:
        m, n = len(grid), len(grid[0])
        q = deque()
        for i in range(m):
            for j in range(n):
                if grid[i][j] == 1:
                    q.append((i, j, 0))

        if not q or len(q) == m*n:
            return -1
        
        dirs = [(0, 1), (0, -1), (1, 0), (-1, 0)]

        while q:
            i, j, d = q.popleft()
            for x, y in dirs:
                ii, jj = i + x, j + y
                if 0 <= ii < m and 0 <= jj < n and grid[ii][jj] == 0:
                    grid[ii][jj] = 1
                    q.append((ii, jj, d+1))
        
        return d