提示:文章写完后,目录可以自动生成,如何生成可参考右边的帮助文档
前言
提示:这里可以添加本文要记录的大概内容:
3月8日练习内容
提示:以下是本篇文章正文内容,下面案例可供参考
一、题目-岛屿数量
1.题目描述
给你一个由 '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
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/number-of-islands
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
2.思路与代码
2.1 思路
1.双重for遍历数组,找出数组中元素为‘1’的位置
2.当元素为‘1’时,使用dfs方法递归调用该位置元素
3.在dfs方法中,先判断i与j的合法性以及递归退出条件
4.将当前位置元素赋值为‘0’,并递归调用其上下左右位置,
2.2 代码
代码如下(示例):
class Solution {
public int numIslands(char[][] grid) {
//求数组的行数与列数
int m = grid.length;
int n = grid[0].length;
//计数器
int count = 0;
for(int i = 0;i < m;i ++){
for(int j = 0;j < n;j ++){
if(grid[i][j] == '1'){
count ++;
dfs(grid,i,j);
}
}
}
return count;
}
public void dfs(char[][] grid,int i, int j){
//判断
if(i < 0 || i >= grid.length || j < 0 || j >= grid[0].length || grid[i][j] == '0'){
return;
}
//将当前位置置为0
grid[i][j] = '0';
//将当前位置的上下左右置为0
dfs(grid,i - 1,j); //上
dfs(grid,i + 1,j); //下
dfs(grid,i,j - 1); //左
dfs(grid,i,j + 1); //右
}
}
总结
提示:这里对文章进行总结: