[leetcode] 547. Friend Circles
来源:互联网 发布:ps4游戏淘宝的 认证版 编辑:程序博客网 时间:2024/06/07 13:41
Question:
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: 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.
Solution:
首先想到的是求连通分量,直接DFS,看能得到多少个无向图的连通分量,就是结果。
class Solution {public: int findCircleNum(vector<vector<int>>& M) { int res = 0; vector<bool> visited(M.size(), false); for (int i = 0; i < M.size(); i++) { if (!visited[i]) { res++; dfs(M, visited, i); } } return res; } void dfs(vector<vector<int>> & M, vector<bool> & visited, int start) { visited[start] = true; for (int i = 0; i < M.size(); i++) { if (!visited[i] && M[start][i] == 1) dfs(M, visited, i); } }};
阅读全文
0 0
- 【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
- leetcode--547. Friend Circles
- leetcode 547. Friend Circles
- [LeetCode] 547. Friend Circles
- 多线程:协调顺序运行
- 刷新输出缓冲区操作flush & ends & endl
- 使用main函数的参数,实现一个整数计算器.
- uva10820(欧拉函数)
- 延迟
- [leetcode] 547. Friend Circles
- C++标准库中string类的介绍
- Python运维自动化开发之Paramiko模块
- VM下Linux的安装步骤(超详细)
- Xshell连接Linux显示乱码解决
- mysql配置修改
- 完全理解python中的迭代器,迭代对象,生成器
- JavaScript数组详解
- 最短路PTA