네트워크 https://programmers.co.kr/learn/courses/30/lessons/43162 풀이 class Solution { public int solution(int n, int[][] computers) { int answer = 0; boolean visited[] = new boolean[n+1]; for(int i=0; i < n; i++){ if( visited[i] == false){ answer += dfs(i, computers, visited); } } return answer; } public static int dfs(int x, int[][] computers, boolean[] visited){ if(visited[x]){ return 0; } visited..