알고리즘 뭐가 틀린건가요? 프로그래머스 - 네트워크

Question

테스트케이스는 다 맞는데 제출하면 전체 실패나옵니다 이유가 뭘까요? def solution(n, computers): dirX &#61; [1,-1,0,0] dirY &#61; [0,0,1,-1] def dfs(x, y): for i in range(4): newX &#61; x&#43;dirX[i] newY &#61; y&#43;dirY[i] if graph[newX][newY] &#61;&#61; 1 and not visited[newX][newY]: visited[newX][newY] &#61; True dfs(newX, newY) graph &#61; [[0] * (n&#43;2) for _ in range(n&#43;2)] visited &#61; [[False] * (n&#43;2) for _ in range(n&#43;2)] for i in range(1,n): for j in range(1,n): graph[i][j] &#61; computers[i][j] answer &#61; 0 for i in range(1,n): for j in range(1,n): if graph[i][j] &#61;&#61; 1 and not visited[i][j]: answer &#43;&#61;1 visited[i][j] &#61; True dfs(i,j) return answer

Dive_Drink_Develope · Answer

[1,0,1][0,1,0][1,0,1] 은 네트워크가 몇개일까요

알고리즘 뭐가 틀린건가요? 프로그래머스 - 네트워크

1개의 답변

기술 목록