Leetcode 547

Leetcode547 FriendCircles

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:N is in range [1,200].
M[i][i] = 1 for all students.
If M[i][j] = 1, then M[j][i] = 1.

题意分析

题目的意思是在一个二位矩阵里面一个点有上下左右四个相邻的点,然后1附近的1是它的“朋友”,如果某个点附近没有点则称之为“孤立的”,所有有朋友的点可以连接在一起,输出一共有多少个朋友圈子。可以从某一个点开始,然后用BFS把毗邻的点全部扫描完,最后计数给出结果。代码如下:

class Solution {
private:
    queue<int> que;
public:
    void bfs(vector<vector<int>>& M, bool* visit, int start) {
        visit[start] = true;
        que.push(start);
        while (!que.empty()) {
            int top = que.front();
            que.pop();
            for (int i = 0; i < M.size(); i++) {
                if (M[top][i] == 1 && visit[i] == false) {
                    que.push(i);
                    visit[i] = true;
                }
            }
        }
    }
    int findCircleNum(vector<vector<int>>& M) {
        int sum = 0, size = M.size();
        bool visit[M.size()] = {false};
        for (int i = 0; i < size; i++) {
            if (visit[i] == false) {
                visit[i] = true;
                sum++;
                bfs(M, visit, i);
            }
        }
        return sum;
    }
};
  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值