[프로그래머스] 네트워크 java (LEVEL3)

https://school.programmers.co.kr/learn/courses/30/lessons/43162

프로그래머스

 

class Solution {
    static boolean[] visited;
    static int len=0;
    static int answer = 0;
    
    public void dfs(int start ,int[][] computers){
        for(int i=0; i<len; i++){
            if(visited[i] == false && computers[start][i] == 1){
                visited[i]=true;
                dfs(i, computers);
            }
        }
    }
    
    public int solution(int n, int[][] computers) {
        len = n;
        visited = new boolean[n];
        for(int i=0; i<n; i++){
            if(visited[i] == false){
                visited[i]=true;
                dfs(i, computers);
                answer++;
            }
        }
        return answer;
    }
}