刷怪日记-飞地数量

题目

解题思路：

• 此题可以类比如邻接矩阵形式，拟采用深度搜索方式解决
• 飞地指的是这部分区域无法抵达边界，那我们可以通过边界元素(值为1)进行深度搜索，遍历值1的就将值设置为0
• 最后通过遍历矩阵，统计值为1的个数，即是飞地的数量

具体代码

class Solution {
    
    int count = 0;
    public int numEnclaves(int[][] grid) {

        int row = grid.length;
        int column = grid[0].length;
        for(int i = 0; i < row; i++){
            if(grid[i][0] == 1){
                dfs(grid, i, 0);
            }
            if(grid[i][column - 1] == 1){
                dfs(grid, i, column - 1);
            }
        }

        for(int i = 0; i < column; i++){
            if(grid[0][i] == 1){
                dfs(grid, 0, i);
            }
            if(grid[row - 1][i] == 1){
                dfs(grid, row-1, i);
            }
        }
        count = 0;
        for(int i = 0; i < grid.length; i++){
            for(int j = 0; j < grid[0].length; j++){
                if(grid[i][j] == 1){
                   count++;
                }
            }
        }
        return count;
    }

    int[][] move = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}};
   
    public void dfs(int[][] grid, int row, int column){

        count++;
        grid[row][column] = 0;
        for(int i = 0; i < 4; i++){
            int nextX = row + move[i][0];
            int nextY = column + move[i][1];
            if(nextX < 0 || nextX >= grid.length || nextY < 0 || nextY >= grid[0].length || grid[nextX][nextY] == 0){
                continue;
            }
            if(grid[nextX][nextY] == 1){
                
                grid[nextX][nextY] = 0;
                dfs(grid, nextX, nextY);
            }
        }
    }
}