leetcode地址: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
算法思路:
本题可以采用深度优先搜索、广度优先搜索、并查集三种方式求解,本篇文章讲解使用并查集的方法
class Solution {
class UnionFind {
//根节点数量
int count;
//保存每个节点的根节点是谁的集合
int[] parent;
//保存每个节点的下级节点的数量
int[] rank;
/*
*假设grid为
* [["1","1","1","1","0"],
* ["1","1","0","1","0"],
* ["1","1","0","0","0"],
* ["0","0","0","0","0"]]
* 初始化的parent
* [0,1,2,3,0,
* 5,6,0,8,0,
* 10,11,0,0,0,
* 0,0,0,0,0]
*初始化的rank = [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
*/
public UnionFind(char[][] grid) {
count = 0;
int m = grid.length;
int n = grid[0].length;
parent = new int[m * n];
rank = new int[m * n];
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j) {
if (grid[i][j] == '1') {
//每个节点的根节点为自己(下标与值相等)
parent[i * n + j] = i * n + j;
++count;
}
rank[i * n + j] = 0;
}
}
}
public int find(int i) {
//如果下标与值不相等,则递归寻找根节点
if (parent[i] != i) parent[i] = find(parent[i]);
return parent[i];
}
public void union(int x, int y) {
//找到x、y的根节点
int rootx = find(x);
int rooty = find(y);
//如果根节点不同进行合并
if (rootx != rooty) {
if (rank[rootx] > rank[rooty]) {
parent[rooty] = rootx;
} else if (rank[rootx] < rank[rooty]) {
parent[rootx] = rooty;
} else {
parent[rooty] = rootx;
rank[rootx] += 1;
}
//合并一个节点就减少一个节点
--count;
}
}
public int getCount() {
return count;
}
}
public int numIslands(char[][] grid) {
if (grid == null || grid.length == 0) {
return 0;
}
int nr = grid.length;
int nc = grid[0].length;
int num_islands = 0;
UnionFind uf = new UnionFind(grid);
for (int r = 0; r < nr; r++) {
for (int c = 0; c < nc; c++) {
if (grid[r][c] == '1') {
grid[r][c] = '0';
//当前节点的上方节点与当前节点进行合并
if (r - 1 >= 0 && grid[r-1][c] == '1') {
uf.union(r * nc + c, (r-1) * nc + c);
}
//当前节点的下方节点与当前节点进行合并
if (r + 1 < nr && grid[r+1][c] == '1') {
uf.union(r * nc + c, (r+1) * nc + c);
}
//当前节点的左方节点与当前节点进行合并
if (c - 1 >= 0 && grid[r][c-1] == '1') {
uf.union(r * nc + c, r * nc + c - 1);
}
//当前节点的右方节点与当前节点进行合并
if (c + 1 < nc && grid[r][c+1] == '1') {
uf.union(r * nc + c, r * nc + c + 1);
}
}
}
}
return uf.getCount();
}
}
复杂度分析
时间复杂度:O(MN∗α(MN)),其中 MM 和 NN 分别为行数和列数。注意当使用路径压缩(见 find 函数)和按秩合并(见数组 rank)实现并查集时,单次操作的时间复杂度为 α(MN),其中α(x) 为反阿克曼函数,当自变量 x 的值在人类可观测的范围内(宇宙中粒子的数量)时,函数 α(x) 的值不会超过 55,因此也可以看成是常数时间复杂度。
空间复杂度:O(MN),这是并查集需要使用的空间。