题目描述:
给你一个由 ‘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
思路:
与LeetCode130. 被围绕的区域 思路一样
遍历整个网格,遇到1,岛屿数量+1,并且把与1相连的其他的1都变成0或者2等等不一样的字符
代码如下:
C++:
class Solution {
public:
void dfs(vector<vector<char>>& grid,int i,int j){
if(i>=0&&j>=0&&i<grid.size()&&j<grid[0].size()&&grid[i][j]=='1'){
grid[i][j]='2';
dfs(grid,i+1,j);
dfs(grid,i-1,j);
dfs(grid,i,j+1);
dfs(grid,i,j-1);
}
}
int numIslands(vector<vector<char>>& grid) {
int res=0;
for(int i=0;i<grid.size();i++){
for(int j=0;j<grid[0].size();j++){
if(grid[i][j]=='1'){
res++;
dfs(grid,i,j);
}
}
}
return res;
}
};
python:
class Solution:
def dfs(self,grid,i,j):
if(i>=0 and j>=0 and i<len(grid) and j<len(grid[0]) and grid[i][j]=='1'):
grid[i][j]='2'
self.dfs(grid,i+1,j)
self.dfs(grid,i-1,j)
self.dfs(grid,i,j+1)
self.dfs(grid,i,j-1)
def numIslands(self, grid: List[List[str]]) -> int:
res=0
for i in range(len(grid)):
for j in range(len(grid[0])):
if grid[i][j]=='1':
res+=1
self.dfs(grid,i,j)
return res
class Solution:
def numIslands(self, grid: List[List[str]]) -> int:
def dfs(i,j):
if(i>=0 and j>=0 and i<len(grid) and j<len(grid[0]) and grid[i][j]=='1'):
grid[i][j]='2'
dfs(i+1,j)
dfs(i-1,j)
dfs(i,j+1)
dfs(i,j-1)
else:return
res=0
for i in range(len(grid)):
for j in range(len(grid[0])):
if grid[i][j]=='1':
res+=1
dfs(i,j)
return res