200-Number of Islands_given an m x n 2d grid map of '1's (land) and '0's-CSDN博客

本文链接：https://blog.csdn.net/LaputaFallen/article/details/80490030

本文介绍了一种使用深度优先搜索(DFS)算法解决岛屿数量计算问题的方法。通过遍历二维字符数组，将每个岛屿上的‘1’标记为已访问，从而统计出岛屿总数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description

Given a 2d grid map of ‘1’s (land) and ‘0’s (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.

Example 1:

Input:
11110
11010
11000
00000

Output: 1

Example 2:

Input:
11000
11000
00100
00011

Output: 3

问题描述

给定二维字符数组grid, 其元素值为’1’(代表陆地), 或者’0’(代表水), 计算出岛的数目。一个岛为横向或者纵向相邻的陆地连接形成。你可以假设grid的四条边被水包围。

问题分析

解题关键还是分组，可以选择就地修改，即在递归的过程中将’1’变为’0’

解法

class Solution {
    public int numIslands(char[][] grid) {
        if(grid == null || grid.length == 0) return 0;

        int m = grid.length, n = grid[0].length;
        int count = 0;

        for(int i = 0; i < m;i++){
            for(int j = 0;j < n;j++){
                if(grid[i][j] == '1'){
                    count++;
                    dfs(grid, m, n, i, j);
                }
            }
        }

        return count;
    }
    public void dfs(char[][] grid, int m, int n, int i, int j){
        if(i >= 0 && i < m && j >= 0 && j < n && grid[i][j] == '1'){
            //注意这里
            grid[i][j] = '0';
            dfs(grid, m, n, i , j - 1);
            dfs(grid, m, n, i - 1, j);
            dfs(grid, m, n, i, j + 1);
            dfs(grid, m, n, i + 1, j);
        }
    }
}