def P3(world: list)->int: def dfs(i, j): if i < 0 or i >= len(world) or j < 0 or j >= len(world[0]) or world[i][j] != 1: return world[i][j] = 0 dfs (i + 1, j) dfs...
태그: 파이썬, 파이썬코딩, python, python3, graph, dfs, 섬의개수
