给你一个由 ‘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 r,c;
void dfs(int i,int j,char[][] grid){
if(i >= r || j >= c) return;
if(grid[i][j] == '0') return;
grid[i][j] = '0';
int dir[][] = {{-1,0},{1,0},{0,1},{0,-1}};
for(int k = 0; k < 4; k++){
int x = i + dir[k][0],y = j + dir[k][1];
if(x >= 0 && x < r && y >= 0 && y < c && grid[x][y] == '1'){
dfs(x,y,grid);
}
}
}
public int numIslands(char[][] grid) {
r = grid.length;
c = grid[0].length;
int ans = 0;
for(int i = 0; i < r; i++){
for(int j = 0; j < c; j++){
if(grid[i][j] == '1'){
ans++;
dfs(i,j,grid);
}
}
}
return ans;
}
}