zoukankan      html  css  js  c++  java
  • Union Find-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 dfs(vector<vector<int>>& M, bool *visited, int ind){
            if(visited[ind] == 1) return 0;
            else{
                visited[ind] = 1;
                int ccnum = 1;
                for(int j = 0; j < M.size(); j++){
                    if(ind != j && M[ind][j] == 1){
                        ccnum += dfs(M, visited, j);
                    }
                }
                return ccnum;
            }
    
        }
        int findCircleNum(vector<vector<int>>& M) {
            int size = M.size();
            if(size == 0) return 0;
            else{
                bool visited[size];
                memset(visited, 0, size);
                int cnum = 0;
                for(int i = 0; i < size; i++){
                    if(dfs(M, visited, i) > 0)
                    cnum++;
                }
                return cnum;
            }
    
        }
    };
  • 相关阅读:
    点击空白处隐藏盒子
    java缓存技术
    使用Java处理大文件
    java实现把一个大文件切割成N个固定大小的文件
    笔记:Java的IO性能调整
    NIO之轻松读取大文件
    java读写文件,读超大文件
    java读取大文件 超大文件的几种方法
    java web服务器cpu占用过高的处理
    软件开发各类文档模板
  • 原文地址:https://www.cnblogs.com/msymm/p/8278247.html
Copyright © 2011-2022 走看看