from collections import dequedef count_common_restaurants(m, n, grid): # 找到小华和小为的位置 persons = restaurants = for i in range(m): for j in range(n): if grid[i][j] == 2: persons.append((i, j)) elif grid[i][j] == 3: restaurants.append((i, j)) if len(persons) != 2: return 0 # BFS函数，返回能到达的聚餐地点集合 def bfs(start_i, start_j): visited = [[False for _ in range(n)] for _ in range(m)] q = deque q.append((start_i, start_j)) visited[start_i][start_j] = True reachable = set while q: i, j = q.popleft for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]: ni, nj = i + di, j + dj if 0摘要：from collections import dequedef count_common_restaurants(m, n, grid): # 找到小华和小为的位置 persons = restaurants = for i in range(m): for
来源：kk清溪葵酱
