sinat_40469883的博客

class Solution: def numIslands(self, grid: [[str]]) -> int: def dfs(grid, i, j): if not 0 <= i < len(grid) or not 0 <= j < len(grid[0]) or grid[i][j] == '0': return grid[i][j] = '0' dfs(gr...

将矩阵看作无向图，因此用深度优先或者广度优先 class Solution: def exist(self, board: List[List[str]], word: str) -> bool: m, n = len(board), len(board[0]) def dfs(i, j , k): if not 0 <= i < m or not 0 <= j < n or board[i][j] !=...