200. 岛屿数量
难度中等1104
给你一个由 '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
/*深度优先搜索,如果当前为‘1’则将其修改为‘0’(表示此处已被记录),然后寻找上下左右四个方向,如果存在则重复此过程,当搜索完成,
与之相连的‘1’都被修改为‘0’*/
//定义count记录陆地数量
//遍历判断每个元素,若是‘1’则count自增1,之后搜索与之相邻陆地,将其标记为‘0’
//遍历完成返回count
int dir[4][2] = {{0,1}, {1,0}, {-1,0}, {0,-1}};//用二维数组表示四个方向
void dfs(char ** grid, int row, int col, int x, int y)
{
if(x < 0 || x >= row || y < 0 || y >= col || grid[x][y] == '0')//处理边界,是否为‘0’必须得放在最后一个,不然-1
return ; //超出数组范围
else
grid[x][y] = '0';
for(int i = 0; i < 4; i++)
{
int xx = x + dir[i][0];//记录下一位置
int yy = y + dir[i][1];
dfs(grid, row, col, xx, yy);
}
}
int numIslands(char** grid, int gridSize, int* gridColSize)//grindcolSize上传二维数组的列数
{
int col = gridColSize[0];/*列数gridColSize[0]可替换为*gridColSize,[0]表示读取此地址的int型数据,[1]表示读取此地址偏移一个sizeof(int)字节地址的int型数据, 所以在此处两者相等*/
int row = gridSize;//行数
int count = 0;
for(int i = 0; i < row; i++)
for(int j = 0; j < col; j++)//遍历每个点
{
if(grid[i][j] == '1')
{
dfs(grid, row, col, i, j);
count++;
}
}
return count;
}