题目:
题解:深度优先搜索DFS
典型的dfs模板题,注意一下访问控制条件即可。
代码:深度优先搜索DFS
/**
* code200
*/
public class code200 {
public static int numIslands(char[][] grid) {
if(grid.length == 0)
{
return 0;
}
int m = grid.length;
int n = grid[0].length;
boolean visited[][] = new boolean[m][n];
int count = 0;
for(int i = 0; i < m; i++)
{
for(int j = 0; j < n; j++)
{
// 如果是岛屿(陆地)中的一个点,并且没有被访问过,就进行深度优先遍历
if(grid[i][j] == '1' && !visited[i][j])
{
dfs(i, j, m, n, grid, visited);
count++;
}
}
}
return count;
}
// 从坐标为 (i,j) 的点开始进行深度优先遍历
public static void dfs(int i, int j, int m, int n, char grid[][], boolean visited[][])
{
if(i < 0 || i >= m || j < 0 || j >= n || grid[i][j] != '1' || visited[i][j])
{
return;
}
// 把当前格子设置为已访问,然后再从它的上下左右4个方向继续遍历
visited[i][j] = true;
dfs(i + 1, j, m, n, grid, visited);
dfs(i - 1, j, m, n, grid, visited);
dfs(i, j + 1, m, n, grid, visited);
dfs(i, j - 1, m, n, grid, visited);
}
public static void main(String[] args) {
char[][] grid1 = {
{'1', '1', '1', '1', '0'},
{'1', '1', '0', '1', '0'},
{'1', '1', '0', '0', '0'},
{'0', '0', '0', '0', '0'}};
int res1 = numIslands(grid1);
System.out.println(res1);
char[][] grid2 = {
{'1', '1', '0', '0', '0'},
{'1', '1', '0', '0', '0'},
{'0', '0', '1', '0', '0'},
{'0', '0', '0', '1', '1'}};
int res2 = numIslands(grid2);
System.out.println(res2);
}
}