2022.2.12-----leetcode.1020

public static int[][] dirs = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};//四个方向
    private int m, n;
    private boolean[][] marked;//某格是否搜索过

    public int numEnclaves(int[][] grid) {
        m = grid.length;
        n = grid[0].length;
        marked = new boolean[m][n];
        //从四条边开始搜索，能搜索到的一定不是飞地
        for (int i = 0; i < m; i++) {
            dfs(grid, i, 0);
            dfs(grid, i, n - 1);
        }
        for (int j = 1; j < n - 1; j++) {
            dfs(grid, 0, j);
            dfs(grid, m - 1, j);
        }
        int cnt = 0;//飞地数量
        //遍历搜索飞地
        for (int i = 1; i < m - 1; i++) {
            for (int j = 1; j < n - 1; j++) {
                if (grid[i][j] == 1 && !marked[i][j]) {
                    cnt++;
                }
            }
        }
        return cnt;
    }
    //深度优先搜索
    public void dfs(int[][] grid, int row, int col) {
        if (row < 0 || row >= m || col < 0 || col >= n || grid[row][col] == 0 || marked[row][col]) {
            return;
        }
        marked[row][col] = true;
        //在四个方向搜索
        for (int[] dir : dirs) {
            dfs(grid, row + dir[0], col + dir[1]);
        }
    }