剑指offer 专项突破版 116、省份数量

题目链接

思路

• 对于这种图的分类问题是经典的并查集的运用
• 并查集的关键在于两个函数 findFather用来寻找根节点并更新，union用来判断是否需要把两个结点合二为一
• 注意union函数中后面的更新的是fathers[fatherOfI]

class Solution {
    public int findCircleNum(int[][] isConnected) {
        int[] fathers = new int[isConnected.length];
        for(int i = 0 ; i < isConnected.length ; i++){
            fathers[i] = i;
        }

        int result = isConnected.length;
        for(int i = 0 ; i < isConnected.length ; i++){
            for(int j = i + 1; j < isConnected.length ; j++){
                if(1 == isConnected[i][j] && union(fathers,i,j))
                    result--;
            }
        }

        return result;

    }

    private int findFather(int[] fathers , int index){
        if(fathers[index] != index)
            fathers[index] = findFather(fathers,fathers[index]);

        return fathers[index];
    }

    // 判断ij对应结点是否被合并为一个集合
    // 如果合并了 那就返回true
    private boolean union(int[] fathers , int i , int j){
        
        int fatherOfI = findFather(fathers,i) , fatherOfJ = findFather(fathers,j);
        if(fatherOfI == fatherOfJ)
            return false;
        
        fathers[fatherOfI] = fatherOfJ;
        return true;
    }
}