剑指Offer 12 矩阵中的路径

 

将矩阵看作无向图，因此用深度优先或者广度优先

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] != word[k]:
                return False
            if k == len(word) - 1:
                return True
            board[i][j] = ''
            res = dfs(i-1, j, k+1) or dfs(i, j-1, k+1) or dfs(i+1, j, k+1) or dfs(i, j+1, k+1)
            board[i][j] = word[k] #语句写在递归函数之后，因此属于回溯，从最后回溯到前面
            return res
        for i in range(m):
            for j in range(n):
                if dfs(i, j, 0): return True
        return False