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

update 0695.岛屿的最大面积.md

Browse Source
This commit is contained in:
Zeeland
2022-11-19 09:50:57 +08:00
committed by GitHub
parent 1f8ea7bb87
commit 65857d1533
1 changed files with 0 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
problems/0695.岛屿的最大面积.md
View File

@ -197,7 +197,6 @@ class Solution:
if not visited[i][j] and grid[i][j] == 1: if not visited[i][j] and grid[i][j] == 1:
# 每一个新岛屿 # 每一个新岛屿
self.count = 0 self.count = 0
print(f'{self.count}')
self.bfs(grid, visited, i, j) self.bfs(grid, visited, i, j)
result = max(result, self.count) result = max(result, self.count)