zoukankan      html  css  js  c++  java
  • 547. Friend Circles

    There are N students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a direct friend of B, and B is a direct friend of C, then A is an indirect friend of C. And we defined a friend circle is a group of students who are direct or indirect friends.

    Given a N*N matrix M representing the friend relationship between students in the class. If M[i][j] = 1, then the ith and jth students are direct friends with each other, otherwise not. And you have to output the total number of friend circles among all the students.

    Example 1:

    Input: 
    [[1,1,0],
     [1,1,0],
     [0,0,1]]
    Output: 2
    Explanation:The 0th and 1st students are direct friends, so they are in a friend circle. 
    The 2nd student himself is in a friend circle. So return 2.

    Example 2:

    Input: 
    [[1,1,0],
     [1,1,1],
     [0,1,1]]
    Output: 1
    Explanation:The 0th and 1st students are direct friends, the 1st and 2nd students are direct friends, 
    so the 0th and 2nd students are indirect friends. All of them are in the same friend circle, so return 1.

    Note:

    1. N is in range [1,200].
    2. M[i][i] = 1 for all students.
    3. If M[i][j] = 1, then M[j][i] = 1
    class Solution {
        public int findCircleNum(int[][] M) {
            int n = M.length;
            int[] anc = new int[n];
            for(int i = 0; i < n; i++) anc[i] = i;
            boolean[][] used = new boolean[n][n];
            
            for(int i = 0; i < n; i++) {
                for(int j = 0; j < n; j++) {
                    if(i != j && M[i][j] == 1) {
                        if(!used[i][j]) {
                            used[i][j] = true;
                            used[j][i] = true;
                            union(i, j, anc);
                        }
                    }
                }
            }
            
            Set<Integer> set = new HashSet();
            for(int i = 0; i < n; i++) {
                set.add(find(anc, i));
            }
            return set.size();
        }
        
        public int find(int[] anc, int x) {
            if(x != anc[x]) anc[x] = find(anc, anc[x]);
            return anc[x];
        }
        
        public void union(int x, int y, int[] anc) {
            int a = find(anc, x);
            int b = find(anc, y);
            
            anc[a] = b;
        }
    }

    用union find,如果两个人是朋友就把两个人union了,这样也能保证两个人的indirect朋友也是朋友,最后计算有多少个parent

    used数组跳过了i,j中重复的一次

  • 相关阅读:
    什么才是java的基础知识?
    Java的背景、影响及前景
    设计模式分类
    关于日期及日期格式转换的记录
    添加同名工具后台验证后不跳转且保留用户输入的数值
    案件讨论回复中出现把多个附件当成一个评论显示,导致分页出错
    指令发布详情弹窗实现“取消”按钮
    最大间隔分离超平面的唯一性完整证明
    CART算法与剪枝原理
    Spark MLlib学习
  • 原文地址:https://www.cnblogs.com/wentiliangkaihua/p/13437364.html
Copyright © 2011-2022 走看看