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
class Solution {
int[][] nextP = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
public void DFS(char[][] grid, int row, int col, boolean[][] visited, int x, int y){
// 1. 标记
visited[x][y] = true;
// 2. 搜索
for (int i = 0; i < 4; i++) {
int nx = x + nextP[i][0];
int ny = y + nextP[i][1];
if (nx < 0 || nx >= row || ny < 0 || ny >= col) {
continue;
}
if (grid[nx][ny] == '1' && !visited[nx][ny]) {
DFS(grid, row, col, visited, nx, ny);
}
}
}
public int numIslands(char[][] grid) {
int step = 0;
int row = grid.length;
if (row == 0) {
return 0;
}
int col = grid[0].length;
boolean[][] visited = new boolean[row][col];
for (int i = 0; i < row; i++) {
for (int j = 0; j < col; j++) {
// 为陆地且没被访问过
if (grid[i][j] == '1' && !visited[i][j]) {
++step;
DFS(grid, row, col, visited, i, j);
}
}
}
return step;
}
}