200. 岛屿数量
难度 中等
给你一个由 '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
提示:
m == grid.length
n == grid[i].length
1 <= m, n <= 300
grid[i][j]
的值为'0'
或'1'
题解
这道题就是一道深搜广搜的模板题,直接根据条件上模板就行。也建议大家学一下学一下深搜广搜模板,遇到图论题目挺好用的。
深搜
class Solution {
int[] x = {1, -1, 0, 0};//X轴移动(上下)
int[] y = {0, 0, 1, -1};//y轴移动(左右)
public int numIslands(char[][] grid) {
int count = 0;//记录多少个岛屿
for(int i = 0; i < grid.length; i++){//遍历x轴
for(int j = 0; j < grid[0].length; j++){//遍历y轴
if(grid[i][j] == '1'){//如果是岛屿
count++;//岛屿数量+1
dfs(grid, i, j);//深搜处理相邻的所有岛屿
}
}
}
return count;//返回结果
}
void dfs(char[][] grid, int nx, int ny){//深搜处理相邻的所有岛屿
if(grid[nx][ny] == '1'){//如果是岛屿
grid[nx][ny] = '0';//置为不是岛屿
for(int i = 0; i < 4; i++){//上下左右遍历
nx += x[i];
ny += y[i];
if(nx >= 0 && nx < grid.length && ny >= 0 && ny < grid[0].length && grid[nx][ny] == '1'){//边界判断和岛屿判断
dfs(grid, nx, ny);//继续搜索
}
nx -= x[i];
ny -= y[i];
}
}
return;
}
}
广搜
class Solution {
public int numIslands(char[][] grid) {
int r = grid.length;//多少行
int c = grid[0].length;//多少列
int count = 0;//记录岛屿数量
int[] x = {1, -1, 0, 0};//X轴移动(上下)
int[] y = {0 ,0, 1, -1};//y轴移动(左右)
for(int i = 0; i < r; i ++){//遍历x轴
for(int j = 0; j < c; j++){//遍历y轴
if(grid[i][j] == '1'){//如果是岛屿
count++;//岛屿数量+1
grid[i][j] = '0';//置为不是岛屿
Queue<int []> queue = new LinkedList<int []>();//广度搜索辅助队列
queue.offer(new int[]{i, j});//入队
while(!queue.isEmpty()){//队列不为空
int[] now = queue.poll();//出队
int nx = now[0];
int ny = now[1];
for(int k = 0; k < 4; k++){//上下左右遍历
nx += x[k];
ny += y[k];
if(nx >= 0 && nx < r && ny >= 0 && ny < c && grid[nx][ny] == '1'){//边界判断和岛屿判断
grid[nx][ny] = '0';//置为不是岛屿
queue.offer(new int[]{nx, ny});//入队
}
nx -= x[k];
ny -= y[k];
}
}
}
}
}
return count;
}
}