841. Keys and Rooms

最新推荐文章于 2021-09-03 23:39:59 发布

去追啊

最新推荐文章于 2021-09-03 23:39:59 发布

阅读量98

点赞数

分类专栏：抓狂ing

本文链接：https://blog.csdn.net/weixin_40801853/article/details/82224537

版权

抓狂ing 专栏收录该内容

27 篇文章 0 订阅

订阅专栏

DFS BFS?

有向图？

class Solution {

    void dfs( List<List<Integer>> rooms , int room , boolean[] finish){
        if( finish[ room ] ) return;
        else finish[ room ] = true;

        List<Integer> cur = rooms.get(room);

        for( int i = 0 ; i < cur.size() ; i ++ ){
            dfs( rooms , cur.get( i ) , finish );
        }
    }

    public boolean canVisitAllRooms(List<List<Integer>> rooms) {
        int n = rooms.size();
        boolean[] finish = new boolean[n];

       // finish[ 0 ] = true;
        dfs( rooms , 0 , finish );

        for( boolean i : finish )
            if( !i )
                return false;
        return true;
    }
}