0
点赞
收藏
分享

微信扫一扫

dfs之省份数量

静鸡鸡的JC 2022-02-17 阅读 48

每日一题ing,今天是个medium题547. Number of Provinces

class Solution {
public:
    int findCircleNum(vector<vector<int>>& isConnected) {
        int len=isConnected.size(),circle=0;
        vector<int> visit;
        for(int i=0;i<len;i++){
            visit.push_back(0);
        }
        for(int i=0;i<len;i++){
            if(visit[i]==0){
                dfs(isConnected,visit,i);
                circle++;
            }
        }
        return circle;
    }

    void dfs(vector<vector<int>>& isConnected,vector<int> &visit, int i){
        visit[i]=1;
        int len=isConnected.size();
        for(int j=0;j<len;j++){
            if(visit[j]==0&&isConnected[i][j]==1){
                dfs(isConnected,visit,j);
            }
        }
    }
};

举报

相关推荐

0 条评论