#leetcode编程日记#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.

注意事项

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.

解题思路

我的思路

这个方法比较暴力。最坏情况需要O（n2）时间复杂度，没用上递归，discuss版块大佬们用的dfs。

①每个人跟其他所有人对比“朋友圈”，如果两个朋友圈之间有交集（代码中用与操作来表示），也就是两个人之间有直接或间接的联系就把两人的朋友圈合并，保留合并后的朋友圈。

②经过最多n*n次合并（或尝试合并，可以在此处对程序进一步简化：给已被合并的“朋友圈”打上标志，不再访问）后，就不能再合并了。

③计算合并后的“朋友圈”个数。

欢迎评论交流~~

代码

class Solution {
public:
    int findCircleNum(vector<vector<int>>& M) {
        int i,j,b,size=M.size();
        for(i=0;i<size;i++){
            for(j=0;j<size;j++){
                if(i==j){
                    continue;
                }
                for(b=0;b<size;b++){
                    if(M[i][b]&M[j][b]){
                        for(int b2=0;b2<size;b2++){
                            M[i][b2]|=M[j][b2];
                            M[j][b2]=0;
                        }
                        break;
                    }
                }
            }
        }
        int cnt=0;
        for(i=0;i<size;i++){
            for(b=0;b<size;b++){
                if(M[i][b]){
                    cnt++;
                    break;
                }    
            }
        }
        return cnt;
    }
};