200. 岛屿数量
难度中等1450
给你一个由 '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'
1.c++
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
void DFS(int x,int y,const int& m,const int& n,vector<vector<bool>>& visit_map,const vector<vector<char>>& grid)
{
//up
if (y-1 >=0 and visit_map[x][y-1] == false && grid[x][y-1] == '1')
{
visit_map[x][y-1] = true;
DFS(x,y-1,m,n,visit_map,grid);
}
//down
if (y + 1 < n and visit_map[x][y+1] == false && grid[x][y+1] == '1')
{
visit_map[x][y+1] = true;
DFS(x,y+1,m,n,visit_map,grid);
}
//left
if (x -1 >=0 and visit_map[x-1][y] == false && grid[x-1][y] == '1')
{
visit_map[x-1][y] = true;
DFS(x-1,y,m,n,visit_map,grid);
}
//right
if (x + 1 < m and visit_map[x+1][y] == false && grid[x+1][y] == '1')
{
visit_map[x+1][y] = true;
DFS(x+1,y,m,n,visit_map,grid);
}
return ;
}
int numIslands(vector<vector<char>>& grid) {
int m = grid.size();
int n = grid[0].size();
int num = 0;
vector<bool> row(n,false);
vector<vector<bool>> visit_map(m,row);
for (int i = 0; i < m;++i)
{
for (int j = 0; j < n;++j)
{
if (visit_map[i][j] == false && grid[i][j] == '1')
{
DFS(i,j,m,n,visit_map,grid);
++num;
}
}
}
return num;
}
};
int main()
{
Solution slu;
vector<vector<char>> grid = {
{'1','1','1','1','0'},
{'1','1','0','1','0'},
{'1','1','0','0','0'},
{'0','0','0','0','0'}
};
cout<<slu.numIslands(grid)<<endl;
}