题目
深搜
遍历地图,每遇到一个连通图,都将其所有元素标记为 true ,然后遍历下一个连通图即可。时间复杂度 O ( m n ) O(mn) O(mn) ,空间复杂度 O ( m n ) O(mn) O(mn) :
class Solution {
public:
void df(vector<vector<char>>& grid, vector<vector<bool>>& flag, int i, int j) {
int m = grid.size(), n = grid[0].size();
flag[i][j] = true;
if(i+1<m && grid[i+1][j]=='1' && !flag[i+1][j])
df(grid, flag, i+1, j);
if(i-1>=0 && grid[i-1][j]=='1' && !flag[i-1][j])
df(grid, flag, i-1, j);
if(j+1<n && grid[i][j+1]=='1' && !flag[i][j+1])
df(grid, flag, i, j+1);
if(j-1>=0 && grid[i][j-1]=='1' && !flag[i][j-1])
df(grid, flag, i, j-1);
}
int numIslands(vector<vector<char>>& grid) {
int m = grid.size(), n = grid[0].size(), ans = 0;
vector<vector<bool>> flag(m, vector<bool>(n, false));
for(int i = 0; i < m; ++i)
for(int j = 0; j < n; ++j)
if(grid[i][j] == '1' && !flag[i][j]) {
ans++;
df(grid, flag, i, j);
}
return ans;
}
};
并查集
可以遍历地图上所有 1 ,如果周围有与其连接的 1 ,则将其合并。时间复杂度 O ( m n + α ( m n ) ) O(mn+\alpha(mn)) O(mn+α(mn)) ,空间复杂度 O ( m n ) O(mn) O(mn) ,考虑到遍历过程每次只会处理右边和下边的元素,因此还可以进行优化:
class Solution {
public:
int init(vector<vector<char>>& grid, vector<int>& fa, vector<int>& rank) {
int m = grid.size(), n = grid[0].size(), ans = 0;
for(int i = 0; i < m; ++i)
for(int j = 0; j < n; ++j) {
fa[i * n + j] = i * n + j;
rank[i * n + j] = 1;
if(grid[i][j] == '1')
ans++;
}
return ans;
}
int find(vector<int>& fa, int x) {
if(fa[x] != x)
fa[x] = find(fa, fa[x]);
return fa[x];
}
void merge(vector<int>& fa, vector<int>& rank, int i, int j, int &ans) {
int x = find(fa, i), y = find(fa, j);
if(x != y) {
if(rank[x] <= rank[y])
fa[x] = y;
else fa[y] = x;
if(rank[x] == rank[y])
rank[y]++;
ans--;
}
}
int numIslands(vector<vector<char>>& grid) {
int m = grid.size(), n = grid[0].size();
vector<int> fa(m * n), rank(m * n);
int ans = init(grid, fa, rank);
for(int i = 0; i < m; ++i)
for(int j = 0; j < n; ++j)
if(grid[i][j] == '1') {
if(i+1<m && grid[i+1][j]=='1') merge(fa, rank, i*n+j, (i+1)*n+j, ans);
if(j+1<n && grid[i][j+1]=='1') merge(fa, rank, i*n+j, i*n+(j+1), ans);
}
return ans;
}
};