题目: 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.
分析
这道题刚看到第一个思路就是类比连通块,其实就是找到图中所有的连通块,就是所有的朋友圈,但是,一开始忽略了一种特殊情况,就是下面这种情况:
1001
0110
0110
1001
这里是只有一个朋友圈,但是如果用连通块的思路,会算成5个朋友圈,所以需要处理一下,借助visited数组存储访问到的人。
代码
class Solution {
public:
int findCircleNum(vector<vector<int>>& M) {
if (M.empty()) return 0;
int n = M.size();
vector<bool> visited(n, false);
int groups = 0;
for (int i = 0; i < visited.size(); i++) {
if (!visited[i]) {
groups++;
dfs(i, M, visited);
}
}
return groups;
}
void dfs(int i, vector<vector<int>>& M, vector<bool>& visited) {
visited[i] = true;
for (int j = 0; j < visited.size(); j++) {
if (i != j && M[i][j] && !visited[j]) {
dfs(j, M, visited);
}
}
}
};