leetcode 547. Friend Circles 寻找图的环的数量 + 深度优先遍历DFS
来源:互联网 发布:jacs在什么数据库 编辑:程序博客网 时间:2024/06/14 06:32
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:
N is in range [1,200].
M[i][i] = 1 for all students.
If M[i][j] = 1, then M[j][i] = 1.
本题题意很简单,就是在一个图中寻找环的数量,由于不需要找到具体的环的元素,所以直接DFS深度优先遍历即可,别的不需要考虑
代码如下:
#include <iostream>#include <vector>#include <map>#include <set>#include <queue>#include <stack>#include <string>#include <climits>#include <algorithm>#include <sstream>#include <functional>#include <bitset>#include <numeric>#include <cmath>using namespace std;class Solution{public: int findCircleNum(vector<vector<int>>& m) { int count = 0; vector<bool> visit(m.size(), false); for (int i = 0; i < m.size(); i++) { if (visit[i] == false) { dfs(m, i, visit); count++; } } return count; } void dfs(vector<vector<int>>& m,int index, vector<bool>& visit) { visit[index] = true; for (int i = 0; i < m.size(); i++) { if (m[index][i] == 1 && visit[i] == false) { dfs(m, i, visit); } } }};
- leetcode 547. Friend Circles 寻找图的环的数量 + 深度优先遍历DFS
- LeetCode-547. Friend Circles(JAVA)朋友圈数量
- 图的遍历---深度优先搜索(DFS)
- DFS 图的深度优先遍历
- 图的深度优先遍历 DFS
- 图的深度优先遍历(DFS)
- 数据结构-图的深度优先遍历(DFS)
- 图的遍历 DFS(深度优先),BFS(广度优先)
- 【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
- Hadoop2.0中HDFS高可用性的实现原理
- shiro安全框架HelloWord入门篇
- JDK8堆内存划分变化
- 严重: Exception sending context initialized event to listener instance of class [org.springframework.w
- 模板基础知识1——《C++程序设计语言(第四版)》第23章 模板 笔记
- leetcode 547. Friend Circles 寻找图的环的数量 + 深度优先遍历DFS
- 什么是OGNL表达式
- The number of divisors(约数) about Humble Numbers
- URI is not registered ( Setting | Project Settings | Schemas and DTDs )
- 机房重构
- 机房收费系统——登录
- Biorhythms 笔记
- 基础知识之nginx重写规则
- 2017.12.11-2017.12.17的周总结