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

debug python version, set visited[x][y] to True in the beginning of bfs

Browse Source
This commit is contained in:
HONGYAN ZHAO
2024-10-24 21:08:52 -05:00
parent d64a535938
commit 492f45f53d
1 changed files with 1 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
problems/kamacoder/0099.岛屿的数量广搜.md
View File

@ -254,6 +254,7 @@ directions = [[0, 1], [1, 0], [0, -1], [-1, 0]]
def bfs(grid, visited, x, y): def bfs(grid, visited, x, y):
que = deque([]) que = deque([])
que.append([x,y]) que.append([x,y])
visited[x][y] = True
while que: while que:
cur_x, cur_y = que.popleft() cur_x, cur_y = que.popleft()
for i, j in directions: for i, j in directions: