leetcode 547. Friend Circles

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/qq_33797928/article/details/80176480

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.
在二维数组中寻找朋友圈数,M[i][j] 代表 i 和 j 是direct friend ,如果 M[j][k] j 和 k 是direct friend ,但是 i 和 k 不是direct friend 。
和那道让我们求 无向图中有多少连通分支数目差不多leetcode原题目, 只不过有一点歧义。
如果我们说 M[i][j] = 1, i j 是direct friend , M[i][i] 又有什么意义呢? 所以如果M中用BFS搜索的话,肯定是WA的,因为可能会有 M[i][j] = 1 && M[i][i] = 0 && M[j][j] = 0 自己和自己也不是direct friend ,有点奇怪。但是题目就是这样出的。所以需要控制搜索的判断条件 M[pop][j] == 1 && !visit[j] && pop != j

class Solution {
    public int findCircleNum(int[][] M) {
        int res = 0;
        int n = M.length;
        if (M == null || M.length == 0 || M[0].length == 0 ){
            res++;
        }
        Queue<Integer> queue = new LinkedList<>();
        boolean[] visit = new boolean[n];
        for (int i = 0; i < n; i++) {
            if (visit[i]) {
                continue;
            }
            queue.offer(i);
            while (!queue.isEmpty()) {
                int pop = queue.poll();
                visit[pop] = true;
                for (int j = 0; j < n; j++) {
                    if (M[pop][j] == 1 && !visit[j] && pop != j) {
                        queue.offer(j);
                    }
                }
            }
            res++;
        }
        return res;
    }
}

没有更多推荐了,返回首页