题目大意:给出二维地图,1代表陆地,0代表水,上下左右相邻的陆地算一个岛,判断岛屿的数量。
分析:dfs/并查集。dfs的思路就是遍历二维数组,每次遇到一个为1的陆地,就代表多了一个岛屿,并dfs将与它相连的所有陆地都变为0。dfs更简单。
代码:
法一:并查集转载自http://blog.csdn.net/jmspan/article/details/51311628
public class Solution {
public int numIslands(char[][] grid) {
if (grid == null || grid.length == 0 || grid[0].length == 0) return 0;
int m = grid.length;
int n = grid[0].length;
int[] roots = new int[m*n];
int islands = 0;
for(int i=0; i<m; i++) {
for(int j=0; j<n; j++) {
if (grid[i][j] == '0') continue;
int id = i * n + j;
roots[id] = id;
islands ++;
if (i>0 && grid[i-1][j] == '1') {
int neighbor = (i-1) * n + j;
int nr = root(roots, neighbor);
if (nr != id) {
roots[nr] = id;
islands --;
}
}
if (j>0 && grid[i][j-1] == '1') {
int neighbor = i * n + (j-1);
int nr = root(roots, neighbor);
if (nr != id) {
roots[nr] = id;
islands --;
}
}
}
}
return islands;
}
private int root(int[] roots, int id) {
while (id != roots[id]) id = roots[roots[id]];
return id;
}
}
法二:dfs
int dir[4][2]={{-1,0},{1,0},{0,1},{0,-1}};
class Solution {
public:
void dfs(int i,int j,vector< vector<char> >& grid) {
grid[i][j] = '0';
for(int k=0;k<4;k++){
int x=i+dir[k][0];
int y=j+dir[k][1];
if(x>=0&&x<grid.size()&&y>=0&&y<grid[0].size()&&grid[x][y]=='1'){
dfs(x,y,grid);
}
}
}
int numIslands(vector< vector<char> >& grid) {
int sum=0;
for(int i=0;i<grid.size();i++)
for(int j=0;j<grid[i].size();j++){
if(grid[i][j]=='1'){
sum++;
dfs(i,j,grid);
}
}
return sum;
}
};