547. Number of Provinces!

class Solution {
    public int findCircleNum(int[][] isConnected) {
        int len = isConnected.length;
        int sum = 0;
        
        boolean[] isVisited = new boolean[len];
        for (int i=0; i<len; i++){
            if(!isVisited[i]){ 
                sum++;
                dfs(isConnected, isVisited, i);
            }
        }
        return sum;
    }
    
    private void dfs(int[][] isConnected, boolean[] isVisited, int i){
        for(int j=0; j<isConnected.length; j++){
            if(isConnected[i][j]==1 && !isVisited[j]){
                isVisited[j]=true;
                dfs(isConnected, isVisited, j);
            }
        }
    }
}