首页 / PYTHON / LeetCode in Python 547. Friend Circles

LeetCode in Python 547. Friend Circles

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了LeetCode in Python 547. Friend Circles，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含1773字，纯文字阅读大概需要3分钟。

内容图文

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.

Solution:

class Solution(object):
    def findCircleNum(self, M):
        """
        :type M: List[List[int]]
        :rtype: int
        """
        #map: key:# value:group#
        #list[i] => i-th element's group#
        rows = len(M)
        groupMap = [i for i in range(rows)]
        
        def dfs(group, index):
            groupMap[index] = group
            for col, friend in enumerate(M[index]):
                if col != index and friend and groupMap[col] == col:
                    dfs(group, col)
            
        for row in range(rows):
            if groupMap[row] != row: continue
            dfs(row, row)
                    
        return len(set(groupMap))

很有名的dfs题朋友圈，思路是序号从0开始，找到它可达的所有朋友（类似连通图），这些人为同一group，以list代替map表示第i个元素对应的group number，到最后以它取set，其长度即朋友圈的个数。

内容总结

以上是互联网集市为您收集整理的LeetCode in Python 547. Friend Circles全部内容，希望文章能够帮你解决LeetCode in Python 547. Friend Circles所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端

扫描二维码推送至手机访问。

本文链接：https://qyyshop.com/info/755666.html

来源：【匿名】