Given a 2d grid map of '1'
s (land) and '0'
s (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.
Example 1:
11110
11010
11000
00000
Answer: 1
Example 2:
11000
11000
00100
00011
Answer: 3
题目解析:把这组数中的1看成岛屿,0看成水,数组四周也是水,看看有多少块岛屿
代码:
public class Solution {
public int numIslands(char[][] grid) {
if(grid.length==0||grid[0].length==0)return 0;
int x=grid.length;
int y=grid[0].length;
int count=0;
for(int i=0;i<x;i++){
for(int j=0;j<y;j++){
if(grid[i][j]=='1'){
DFS(grid,i,j);
count++;
}
}
}
return count;
}
public static void DFS(char[][] grid,int x,int y){
if(x<0||x>=grid.length) return;
if(y<0||y>=grid[0].length) return ;
if(grid[x][y]!='1') return;
grid[x][y]='x';
DFS(grid,x-1,y);
DFS(grid,x,y-1);
DFS(grid,x+1,y);
DFS(grid,x,y+1);
}
}