286-Walls-And-Gates
Sat 17 May 2025
https://leetcode.com/problems/walls-and-gates
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def wallsAndGates(self, rooms: List[List[int]]) -> None:
kInf = 2**31 - 1
m = len(rooms)
n = len(rooms[0])
dirs = [0, 1, 0, -1, 0]
q = deque()
for i in range(m):
for j in range(n):
if rooms[i][j] == 0:
q.append((i, j))
while q:
i, j = q.popleft()
for k in range(4):
x = i + dirs[k]
y = j + dirs[k + 1]
if x < 0 or x == m or y < 0 or y == n:
continue
if rooms[x][y] != kInf:
continue
rooms[x][y] = rooms[i][j] + 1
q.append((x, y))
new Solution().wallsAndGates()
Score: 5
Category: leetcode