algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 16:54:50 +08:00
Code Issues Packages Projects Releases Wiki Activity

Apply suggestions from code review

Browse Source
This commit is contained in:
fwqaaq
2024-01-11 17:40:16 +08:00
committed by GitHub
parent f6557d7ddc
commit 26c4004d74
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0200.岛屿数量.深搜版.md
View File

@ -413,13 +413,13 @@ func numIslands(grid [][]byte) int {
} }
func dfs(grid [][]byte, visited [][]bool, i, j int) { func dfs(grid [][]byte, visited [][]bool, i, j int) {
visited[x][y] = true
for _, d := range DIRECTIONS { for _, d := range DIRECTIONS {
x, y := i+d[0], j+d[1] x, y := i+d[0], j+d[1]
if x < 0 || x >= len(grid) || y < 0 || y >= len(grid[0]) { if x < 0 || x >= len(grid) || y < 0 || y >= len(grid[0]) {
continue continue
} }
if grid[x][y] == '1' && !visited[x][y] { if grid[x][y] == '1' && !visited[x][y] {
visited[x][y] = true
dfs(grid, visited, x, y) dfs(grid, visited, x, y)
} }
} }