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.

    M[0][1]  表示0和1是直接好友关系

    M[1][2]  表示1和2是直接好友关系   0,2是间接好友关系  他们是一个朋友圈

    求有多少个朋友圈,也就是无向图的连通分量

    C++:

     1 class Solution {
     2 public:
     3     int findCircleNum(vector<vector<int>>& M) {
     4         int n = M.size() ;
     5         int res = 0 ;
     6         vector<bool> visit(n , false) ;
     7         for(int i = 0 ; i < n ; i++){
     8             if (!visit[i]){
     9                 dfs(i,M,visit) ;
    10                 res++ ;
    11             }
    12         }
    13         return res ;
    14     }
    15     
    16     void dfs(int i , vector<vector<int>> M , vector<bool>& visit){
    17         visit[i] = true ;
    18         for(int j = 0 ; j < M.size() ; j++){
    19             if (M[i][j] == 1 && !visit[j]){
    20                 dfs(j,M,visit) ;
    21             }
    22         }
    23     }
    24 };
  • 相关阅读:
    进程实际操作篇2
    进程的实际操作篇1
    进程的理论知识
    解决套接字粘包,udp套接字对象的使用和socketserver模块实现并发
    day24-网络知识扫盲,socket的基本使用
    day23-网络编程之互联网基础,tcp/ip协议详细介绍
    day21-多态和多态性,鸭子类型,反射,内置方法,异常处理
    JAVA WEB小测
    JAVA动手动脑
    JAVA课上动手动脑问题2
  • 原文地址:https://www.cnblogs.com/mengchunchen/p/10339574.html
Copyright © 2011-2022 走看看