547-Friend Circles

本文介绍了一种算法,用于计算学生之间的社交圈子数量。通过输入一个N×N的矩阵来表示学生之间的直接友谊关系,该算法可以找出所有间接友谊关系,并最终确定社交圈子的数量。文章提供了两种实现方式:并查集和深度优先搜索。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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.

问题描述


问题分析


解法1(并查集)

class Solution {
    class UnionFind{
        private int count = 0;
        private int[] parent, rank;

        public UnionFind(int n){
            count = n;
            parent = new int[n];
            rank = new int[n];

            for(int i = 0;i < n;i++){
                parent[i] = i;
            }
        }
        public int find(int i){
            while(i != parent[i]){
                parent[i] = parent[parent[i]];
                i = parent[i];
            }

            return i;
        }
        public void union(int i, int j){
            int rooti = find(i);
            int rootj = find(j);

            if(rooti == rootj) return;

            if(rank[rooti] > rank[rootj]){
                parent[rootj] = rooti;
            }else{
                parent[rooti] = rootj;
                if(rank[rooti] == rank[rootj]){
                    rank[rootj]++;
                }
            }
            count--;
        }
        public int getCount(){
            return count;
        }
    }

    public int findCircleNum(int[][] M) {
        int n = M.length;
        UnionFind union = new UnionFind(n);

        for(int i = 0;i < n;i++){
            for(int j = i + 1;j < n;j++){
                if(M[i][j] == 1)    union.union(i,j);
            }
        }

        return union.getCount();
    }
}

解法2(DFS)

public class Solution {
    public int findCircleNum(int[][] M) {
        int[] visited = new int[M.length];
        int count = 0;
        for (int i = 0; i < M.length; i++) {
            if (visited[i] == 0) {
                dfs(M, visited, i);
                count++;
            }
        }
        return count;
    }
    public void dfs(int[][] M, int[] visited, int i) {
        for (int j = 0; j < M.length; j++) {
            if (M[i][j] == 1 && visited[j] == 0) {
                visited[j] = 1;
                dfs(M, visited, j);
            }
        }
    }
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值