问题来源
问题描述
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(vector<vector<int>>& M) {
int n = M.size();
vector<int> parents(n,0);
for (int i = 0; i < n; i++) parents[i] = i;
int f = n; // 初始假设所有人属于不同集
for (int i = 0; i < n; i++)
for (int j = i+1; j < n;j++) {
if (M[i][j]) {
int s1 = find_set(i,parents);
int s2 = find_set(j,parents);
if (s1 != s2) {
parents[s1] = s2;
f--;
}
}
}
return f;
}
int find_set(int x, vector<int> & parents) {
return parents[x] == x ? x : find_set(parents[x], parents);
}
};