leetcode 547. Friend Circles

最新推荐文章于 2020-05-26 13:07:51 发布

liqinzhe223

最新推荐文章于 2020-05-26 13:07:51 发布

阅读量184

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/liqinzhe11/article/details/78040058

版权

leetcode 专栏收录该内容

280 篇文章 0 订阅

订阅专栏

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.

这个题使用了并查集（union find）：

里面有两个关键点

1、find_head函数是找这个集体的老大，如果是一个老大，说明是一个集体

int find_head(int x)
{
if (head[x] == x)
return x;
return head[x] = find_head(head[x]); //递归赋值，这样每一个都直接指向老大，不用挨个找，浪费时间
}

2、

int head_i = find_head(i);
int head_j = find_head(j);
if (head_i != head_j) //本来不是一个集体，现在连上了，所以集体数减一
{
head[head_j] = head_i; //必须是一边的老大指向另一边的老大，而不是小弟去指，因为只有老大指，小弟才代表换了边
ret--; //本题中，合并一次，代表集体数目减少一个
}

class Solution {
public:
    int findCircleNum(vector<vector<int>>& M) 
    {  
        int ret = M.size();
        for (int i = 0; i < M.size(); i++)
            head.push_back(i);
        
        for (int i = 0; i < M.size(); i++)
        {
            for (int j = i + 1; j < M.size(); j++)
            {
                if (M[i][j] == 1)
                {
                    int head_i = find_head(i);    
                    int head_j = find_head(j);
                    if (head_i != head_j)  //本来不是一个集体，现在连上了，所以集体数减一
                    {
                        head[head_j] = head_i; 
                        ret--;
                    }
                } 
            }
        }
        return ret;
    }
private:
    vector<int> head;
    int find_head(int x)
    {
        if (head[x] == x)
            return x;
        return head[x] = find_head(head[x]);
    }
};