Leetcode_1020_飞地的数量_dfs

最新推荐文章于 2024-05-25 15:59:47 发布

九幽孤翎

最新推荐文章于 2024-05-25 15:59:47 发布

阅读量243

点赞数

分类专栏： daily_algorithm dfs 文章标签：深度优先 leetcode 算法

本文链接：https://blog.csdn.net/HDUCheater/article/details/122893490

版权

daily_algorithm 同时被 2 个专栏收录

230 篇文章 0 订阅

订阅专栏

dfs

11 篇文章 0 订阅

订阅专栏

朴实无华的深搜

class Solution {
    int n;
    int m;
    int ans;
    boolean[][] vis;
    int[][] grid;
    int[][] direction = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};

    public int numEnclaves(int[][] grid) {
        n = grid.length;
        m = grid[0].length;
        ans = 0;
        vis = new boolean[n][m];
        this.grid = grid;
        for(int i = 0;i < n;i++) {
            for(int j = 0;j < m;j++) {
                if(grid[i][j] == 1) {
                    if(i == 0 || j == 0 || i == n - 1 || j == m - 1) {
                        dfs(i, j);
                    }
                    ans++;
                }
            }
        }
        return ans;
    }

    void dfs(int x, int y) {
        if(x < 0 || x >= n || y < 0 || y >= m || vis[x][y] == true || grid[x][y] == 0) {
            return;
        }
        vis[x][y] = true;
        ans--;
        for(int[] dir : direction) {
            dfs(x + dir[0], y + dir[1]);
        }
    }
}