算法分析与设计丨第八周丨LeetCode（12）——Friend Circles（Medium）

题目链接：https://leetcode.com/problems/friend-circles/description/

题目描述：

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:

1. N is in range [1,200].
2. M[i][i] = 1 for all students.
3. If M[i][j] = 1, then M[j][i] = 1.

题目解析：

老师刚好讲了并查集，我发现这算法其实蛮有趣。不过速度不算快，我看disscussion里面有前辈用dfs的，那种确实会更快一点。需要注意的是，在一般的并查集算法中，两个节点的rank大小不同会导致选择的father不一样，但是在这道题目里，father都是选择第一个。因为我们是按行列顺序来遍历的，选择行号来当father才对。

class Solution {
public:
    
    
    int find_set(int x,vector<int> father)
    {
        while(x!=father[x])
        {
            x = father[x];
        }
        return x;
    }
    
    int findCircleNum(vector<vector<int>>& M) {
        int size = M[0].size();
        vector<int> father(size);
        vector<int> rank(size);
        for(int i = 0;i < size;++i)
        {
            father[i] = i;
            rank[i] = 1;
        }
        
        int group = size;
        
        for(int i = 0;i < size;++i)
        {
            int father_1 = find_set(i,father);
            for(int j = i+1;j < size;++j)
            {
                if(M[i][j])
                {
                    
                    int father_2 = find_set(j,father);
                    if(father_1 == father_2)
                        continue;
                    
                    if( rank[father_1] > rank[father_2] )
                    {
                        group--;
                        father[father_2] = father_1;
                    }
                    else
                    {
                        if(rank[father_1] == rank[father_2])
                            ++rank[father_1];
                        father[father_2] = father_1;
                        group--;
                    }
                    
                }
                
                
            }
        }
        
        
        return group;
    }
};