leetcode 547. Friend Circles并查集
来源:互联网 发布:全局最优算法 编辑:程序博客网 时间:2024/05/16 12:55
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 adirect 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 directfriends 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: 2Explanation: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: 1Explanation: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:
- N is in range [1,200].
- M[i][i] = 1 for all students.
- If M[i][j] = 1, then M[j][i] = 1.
class Solution(object): def getFather(self , u): if u == self.father[u]: return u self.father[u] = self.getFather(self.father[u]) return self.father[u] def findCircleNum(self, M): n = len(M) self.father = [0]*n for i in range(0 , n): self.father[i] = i for i in range(0 , n): for j in range(0 , n): if 1 == M[i][j]: u = self.getFather(i) v = self.getFather(j) if u != v: self.father[u] = v f = [] for i in range(0 , n): f.append(self.getFather(i)) return len(set(f))if __name__ == '__main__': s = Solution() print(s.findCircleNum([[1,1,0],[1,1,0],[0,0,1]])) print(s.findCircleNum([[1,1,0],[1,1,1],[0,1,1]]))
阅读全文
0 0
- leetcode 547. Friend Circles并查集
- (并查集的应用)LeetCode#547. Friend Circles
- 547. Friend Circles(并查集)
- LeetCode 547 Friend Circles(并查集)
- 【启发】leetcode -- 547. Friend Circles【并查集 + 集合标识更新的时机】
- 【LeetCode】547. Friend Circles
- leetcode 547. Friend Circles
- leetcode 547. Friend Circles
- leetcode-547. Friend Circles
- LeetCode 547. Friend Circles
- #leetcode#547. Friend Circles
- leetcode 547. Friend Circles
- LeetCode 547. Friend Circles
- Leetcode 547. Friend Circles
- [leetcode]547. Friend Circles
- [LeetCode]547. Friend Circles
- leetcode 547. Friend Circles
- [LeetCode] 547. Friend Circles
- linux设备驱动那点事儿之SD卡驱动理论篇
- 1008.数组元素循环右移问题
- springMVC使用@RequestBody接收Json的过程,解决415的问题ss
- [Swift 3.0] 实时动态修改StatusBar状态
- 弹出的蒙层无法盖住input框
- leetcode 547. Friend Circles并查集
- 1999年分区联赛普级组之一 Cantor表(枚举)
- TensorFlow教程视频
- 一文读懂Android View事件分发机制
- 原则汇总列表
- 打开和输出nc 文件。简单的方法
- 条款 02
- 20个JS优化代码技巧
- Linux下修改.bash_profile文件后再次用CRT启动环境变量未生效的解决方法,oracle命令无法使用