题目描述:
给定一个由 ‘1’(陆地)和 ‘0’(水)组成的的二维网格,计算岛屿的数量。一个岛被水包围,并且它是通过水平方向或垂直方向上相邻的陆地连接而成的。你可以假设网格的四个边均被水包围。
深度搜索
class Solution {
public int numIslands(char[][] grid) {
if (grid == null || grid.length == 0 || grid[0].length == 0)
return 0 ;
int row = grid.length;//行数
int column = grid[0].length;//列数
int count = 0;
for (int i = 0; i < row; i++) {
for (int j = 0; j < column; j++) {
if (grid[i][j] == '1'){
count ++;
combine(grid,i,j);
}
}
}
return count;
}
public static void combine(char[][] grid, int x, int y){
grid[x][y] = '2';
if (x > grid.length-1 && y > grid[0].length-1 ) {
return;
}
if (x < grid.length-1 && grid[x+1][y] == '1') {//向下
combine(grid,x+1,y);
}
if (y < grid[0].length-1 && grid[x][y+1] == '1'){//向右
combine(grid,x,y+1);
}
if (x > 0 && grid[x-1][y] == '1' ){//向上
combine(grid,x-1,y);
}
if (y > 0 && grid[x][y-1] == '1') {//向左
combine(grid,x,y-1);
}
}
}