算法题目 :547. Friend Circles
算法题目描述:
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.
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.
算法分析:
这道题目的大意就是给定邻接矩阵M,求连通分量的个数。题目中的朋友圈子就代表一个连通分量,有多少个连通分量就有多少个朋友圈子。网上查了一下,解这种题目有好几种方法,并查集、深度优先搜索/广度优先搜索、Floyd-Warshall算法,由于课堂中学习到的是用深度优先搜索,所以这里解题我们就用深度优先来解答。
算法代码(C++):
class Solution {
public:
int findCircleNum(vector<vector<int>>& M) {
if (M.empty()) return 0;
int n = M.size();
vector<bool> visited;
for(int i=0;i<n;i++)
visited.push_back(false);
int a = 0;
for (int i = 0; i < visited.size(); i++) {
a += dfs(i, M, visited) > 0;
}
return a;
}
private:
int dfs(int i, vector<vector<int>>& M, vector<bool>& visited) {
if (visited[i]) {
return 0;
}
int a = 1;
visited[i] = true;
for (int j = 0; j < visited.size(); j++) {
if (i != j && M[i][j]) {
a += dfs(j, M, visited);
}
}
return a;
}
};
class Solution {
public:
int findCircleNum(vector<vector<int>>& M) {
if (M.empty()) return 0;
int n = M.size();
vector<bool> visited;
for(int i=0;i<n;i++)
visited.push_back(false);
int a = 0;
for (int i = 0; i < visited.size(); i++) {
a += dfs(i, M, visited) > 0;
}
return a;
}
private:
int dfs(int i, vector<vector<int>>& M, vector<bool>& visited) {
if (visited[i]) {
return 0;
}
int a = 1;
visited[i] = true;
for (int j = 0; j < visited.size(); j++) {
if (i != j && M[i][j]) {
a += dfs(j, M, visited);
}
}
return a;
}
};