单词搜索程序(Python)

def find_words(board, words):
    def dfs(board, word, i, j, k):
        if not (0 <= i < len(board) and 0 <= j < len(board[0]) and board[i][j] == word[k]):
            return False
        if k == len(word) - 1:
            return True
        tmp, board[i][j] = board[i][j], '/'
        res = dfs(board, word, i + 1, j, k + 1) or dfs(board, word, i - 1, j, k + 1) or \
              dfs(board, word, i, j + 1, k + 1) or dfs(board, word, i, j - 1, k + 1)
        board[i][j] = tmp
        return res

    def exist(board, word):
        for i in range(len(board)):
            for j in range(len(board[0])):
                if dfs(board, word, i, j, 0):
                    return True
        return False

    result = []
    for word in words:
        if exist(board, word):
            result.append(word)
    return result

# 示例网格和单词列表
board = [
    ['A', 'B', 'C', 'E'],
    ['S', 'F', 'C', 'S'],
    ['A', 'D', 'E', 'E']
]
words = ["ABCCED", "SEE", "ABCB"]

print(find_words(board, words))  # 输出: ['ABCCED', 'SEE']