给你一个由 ‘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
示例 2:
输入:grid = [
[“1”,“1”,“0”,“0”,“0”],
[“1”,“1”,“0”,“0”,“0”],
[“0”,“0”,“1”,“0”,“0”],
[“0”,“0”,“0”,“1”,“1”]
]
输出:3
提示:
m == grid.length
n == grid[i].length
1 <= m, n <= 300
grid[i][j] 的值为 ‘0’ 或 ‘1’
这个题是用并查集写的,感觉还是比较巧妙。
class Solution {
public:
int father[310*310];
int isRoot[310*310] = {0};
void init() {
for(int i=0;i<310*310;i++) {
father[i] = i;
}
}
int findFather(int x) {
int a = x;
while(x != father[x]) {
x = father[x];
}
while(a != father[a]) {
int z = a;
a = father[a];
father[z] = x;
}
return x;
}
void Union(int a,int b) {
int faA = findFather(a);
int faB = findFather(b);
if(faA != faB) {
father[faA] = faB;
}
}
int numIslands(vector<vector<char>>& grid) {
int length1 = grid.size();
int length2;
if(!grid[0].empty()) length2 = grid[0].size();
set<int> ans;
init();
int n = length2;
int count = 0;
for(int i=0;i<length1;i++) {
for(int j=0;j<length2;j++) {
if(grid[i][j] == '1') {
if(i+1<length1 && grid[i+1][j] == '1') {
Union(i*n+j,(i+1)*n+j);
}
if(j+1<length2 && grid[i][j+1] == '1') {
Union(i*n+j,(i)*n+j+1);
}
if(i-1>=0 && grid[i-1][j] == '1') {
Union(i*n+j,(i-1)*n+j);
}
if(j-1>=0 && grid[i][j-1] == '1') {
Union(i*n+j,i*n+j-1);
}
}
else {
count++;
}
}
}
for(int i=0;i<length1;i++) {
for(int j=0;j<length2;j++) {
int x = findFather(i*n+j);
ans.insert(x);
}
}
set<int>::iterator it;
for(it=ans.begin();it!=ans.end();it++) {
//cout<<*it<<" ";
}
//cout<<endl;
return ans.size()-count;
}
};