200| Number of Islands

最新推荐文章于 2026-03-28 10:18:53 发布

原创最新推荐文章于 2026-03-28 10:18:53 发布 · 197 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

leedcode_Algorithm 专栏收录该内容

36 篇文章

订阅专栏

这篇博客讨论了一种使用广度优先搜索(BFS)算法来解决二维网格中计算岛屿数量的问题。给定一个由 '1'（陆地）和 '0'（水）组成的网格，岛屿是由相邻的陆地水平或垂直连接形成的。博客通过两个示例解释了算法的工作原理，并展示了如何通过BFS遍历和标记陆地以避免重复计数。

题目：
Given an m x n 2d grid map of '1’s (land) and '0’s (water), return 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: grid = [
[“1”,“1”,“1”,“1”,“0”],
[“1”,“1”,“0”,“1”,“0”],
[“1”,“1”,“0”,“0”,“0”],
[“0”,“0”,“0”,“0”,“0”]
]
Output: 1

Example 2:
Input: grid = [
[“1”,“1”,“0”,“0”,“0”],
[“1”,“1”,“0”,“0”,“0”],
[“0”,“0”,“1”,“0”,“0”],
[“0”,“0”,“0”,“1”,“1”]
]
Output: 3

Constraints:
m == grid.length
n == grid[i].length
1 <= m, n <= 300
grid[i][j] is ‘0’ or ‘1’.

class Solution {
    public int numIslands(char[][] grid) {

   int  count=0;
   for(int i=0;i<grid.length;i++){
       for(int j=0;j<grid[i].length;j++){
                  if(grid[i][j]=='1'){
                      count+=1;
                      callBFS(grid,i,j);
                  }
       }
   }
   return count;
 }

    public void callBFS(char[][] grid, int i,int j){
        if(i<0||i>=grid.length||j<0||j>=grid[i].length||grid[i][j]=='0')
        return;   
     grid[i][j]='0';
        callBFS(grid,i+1,j);//up
        callBFS(grid,i-1,j);//down
        callBFS(grid,i,j-1);//left
        callBFS(grid,i,j+1);//right

    }
}