547. Friend Circles
来源:互联网 发布:gps漂移过滤算法 编辑:程序博客网 时间:2024/06/05 22:41
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 anindirect 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 aredirect 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.
int findCircleNum(int** M, int MRowSize, int MColSize) {
int i;
int count=0;
bool flag[200]={false};
for(i=0;i<MRowSize;i++){
if(flag[i]==true) continue;
dfs(M,i,MRowSize,MColSize,flag);
count++;
}
return count;
}
void dfs(int** M,int pos, int MRowSize, int MColSize,bool* flag)
{
int i;
flag[pos]=true;
for(i=0;i<MColSize;i++){
if(M[pos][i]==0 || flag[i]==true) continue;
dfs(M,i,MRowSize,MColSize,flag);
}
}
- 【LeetCode】547. Friend Circles
- leetcode 547. Friend Circles
- leetcode 547. Friend Circles
- 547. Friend Circles
- leetcode-547. Friend Circles
- 547. Friend Circles
- LeetCode 547. Friend Circles
- 547. Friend Circles
- 547. Friend Circles
- #leetcode#547. Friend Circles
- No.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
- servlet过滤器使用
- Redis缓存入门学习摘录
- 多个库需要提交时自动生成repo提交脚本
- Notepad工具使用小技巧
- 1.5不支持diamond运算符,请使用source 7或更高版本以启用diamond运算符
- 547. Friend Circles
- idea开发springboot热部署问题
- 时间的朋友
- 前台页面jsp调用qq发起聊天,点击“联系我们”链接弹窗qq聊天窗口
- 线性回归, 逻辑回归和线性分类器
- java菜鸟的Python学习之路(1)
- shell脚本——比较不同目录下所有文件
- hibernate5 快速入门
- 安装MySQL-python, 使用import MySQLdb',报_mysql.so, 2): Symbol not found: _mysql_affected_rows