Problem
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.
解题思路
这是一道很典型的计算图的连通分量的题,即给定一个图是由几部分组成,可以使用深度优先搜索,也可以使用宽度优先搜索。这里采用宽度优先搜索。
代码如下:
class Solution {
public:
int findCircleNum(const vector<vector<int>>& M) {
vector<bool> visited(M.size(), false);
int blocks = 0;
while (1)
{
auto p = find(visited.begin(), visited.end(), false);
if (p == visited.end())
{
return blocks;
}
queue<int> q;
q.push(p - visited.begin());
while (!q.empty())
{
auto node = q.front();
q.pop();
visited[node] = true;
for (size_t next=0;next<M.size();++next)
{
if (M[node][next] && visited[next] == false)
{
q.push(next);
}
}
}
blocks += 1;
}
return 0;
}
};