Friend Circles
来源:互联网 发布:网络三字经全文解释 编辑:程序博客网 时间:2024/05/29 16:05
题目来源LeetCode
题目描述
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.
这道题其实是图论问题,求图的连通分量,通过DFS来遍历朋友,代码如下:
void Findfriend(vector<vector<int>>& M,bool judge[],int m) { judge[m] = true; for (int i = 0; i < M.size();i++) { if (judge[i] == false && M[m][i]==1) Findfriend(M,judge, i); } }class Solution {public: int findCircleNum(vector<vector<int>>& M) { int row = M.size(); if (row == 0)return 0; bool judge[row+1]; memset(judge,false,sizeof(judge)); int cir_num = 0; for (int i = 0; i < row;i++) { if (judge[i]==false) { Findfriend(M, judge, i); cir_num++; } } return cir_num; }};
- Friend Circles
- Friend Circles
- Friend Circles
- Friend Circles
- Friend Circles
- Friend Circles
- Friend Circles
- Friend Circles
- 【LeetCode】547. Friend Circles
- leetcode 547. Friend Circles
- leetcode 547. Friend Circles
- 547. Friend Circles
- leetcode547. Friend Circles
- leetcode-547. Friend Circles
- [LeetCode.547]Friend Circles
- 547. Friend Circles
- LeetCode 547. Friend Circles
- 【547】Friend Circles
- maven resources导致打包失败分析与解决
- 冒泡排序和选择排序,纯JavaScript代码实现,面试必备
- 安装CNTK
- [H.264] 视频压缩原理
- Oracle Scott解锁
- Friend Circles
- ES6 Map Set总结
- Java面试题集(第二部分)(51-70)
- NYOJ 12 喷水装置(二)
- CoreBluetooth连接蓝牙健康设备
- 中国最好的jdbc连接池-------Druid开源连接池的使用
- 虚拟机里的vmnet1 和vmnet8
- 机器人路径规划
- Opencv学习之寻找和绘制物体的凸包