Programmers 네트워크

Answer

class Solution { 
    
    public int dfs(int i, int[][] computers, boolean[] visited) {
        if (visited[i]) {
            return 0; 
        } 
        
        visited[i] = true; 
        
        for (int j = 0; j < computers[i].length; j++) { 
            if (computers[i][j] == 1) { 
                System.out.println(i + " " +  j);
                dfs(j, computers, visited); 
            } 
        } 
        
        return 1; 
    } 
    
    public int solution(int n, int[][] computers) {
        int answer = 0; 
        boolean[] visited = new boolean[n]; 
        
        for (int i = 0; i < n; i++) { 
            if (!visited[i]) { 
                answer += dfs(i, computers, visited); 
            } 
        } 
        
        return answer; 
    } 
    
}