一、题目
给你一个由 '1'(陆地)和 '0'(水)组成的的二维网格,请你计算网格中岛屿的数量。
岛屿总是被水包围,并且每座岛屿只能由水平方向和/或竖直方向上相邻的陆地连接形成。
此外,你可以假设该网格的四条边均被水包围。
示例 1:
输入:grid = [
["1","1","1","1","0"],
["1","1","0","1","0"],
["1","1","0","0","0"],
["0","0","0","0","0"]
]
输出:1
示例 2:
输入:grid = [
["1","1","0","0","0"],
["1","1","0","0","0"],
["0","0","1","0","0"],
["0","0","0","1","1"]
]
输出:3
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/number-of-islands
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
二、解题思路
首先,我们先来理解一下题目,大家如果对怎么判断这是一个岛屿不太理解的话,不妨看一下我下面画的图。
这就是示例2所说的3个岛,所以很明显,判断陆地之间是否连通只需要看上下左右四个坐标点,很像今早我做的另外一道题:图像渲染,大家可以移步看一下。
理解了以后,其实就很好解了,找到值为‘1’的点,岛屿数量++,然后通过深搜找出它的其他相连陆地,并把值改为非‘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[0].length; j++) {
if(grid[i][j] == '1') {
count++;
dfs(grid, i, j);
}
}
}
return count;
}
public void dfs(char[][] grid, int i, int j) {
if(i < 0 || i > grid.length - 1 || j < 0 || j > grid[0].length - 1 ||
grid[i][j] != '1') {
return;
}
grid[i][j] = '2';
dfs(grid, i - 1, j);
dfs(grid, i + 1, j);
dfs(grid, i, j - 1);
dfs(grid, i, j + 1);
}
}