codenextdoor

😉 아이디어1. _!A ~ UUUUU!_까지의 DFS 실행2. 중간에 목표로 하는 단어와 일치하는 경우 count 횟수 저장😉 풀이cnt = 0saved = 99_999def dfs(word, ws, result): global cnt global saved if 1 ✔️ 링크 : https://school.programmers.co.kr/learn/courses/30/lessons/84512#

def solution(n, computers): length = len(computers) graph = [[0 for _ in range(length)] for __ in range(length)] visited = [[0 for _ in range(length)] for __ in range(length)] net = [0] * n for i in range(length): com = computers[i] for j in range(length): if i == j or com[j] == 0: continue graph[i][j] = 1 networks = 0 for i in range(n): for j in range(n): if i == j or graph[i][j] == 0 or visite..