LeetCode79. 单词搜索（DFS+4种directions）

1、题目描述

https://leetcode-cn.com/problems/word-search/

给定一个二维网格和一个单词，找出该单词是否存在于网格中。

单词必须按照字母顺序，通过相邻的单元格内的字母构成，其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。

board =
[
  ['A','B','C','E'],
  ['S','F','C','S'],
  ['A','D','E','E']
]

给定 word = "ABCCED", 返回 true
给定 word = "SEE", 返回 true
给定 word = "ABCB", 返回 false

• board 和 word 中只包含大写和小写英文字母。
• 1 <= board.length <= 200
• 1 <= board[i].length <= 200
• 1 <= word.length <= 10^3

2、代码详解

DFS+directions四方向（回溯思想）

from typing import List
class Solution:

    directions = [(-1, 0), (0, 1), (1, 0), (0, -1)]  # （行号，列号）上，右，下，左顺序搜索，其实顺序无关紧要

    def exist(self, board: List[List[str]], word: str) -> bool:
        m = len(board)  # 行数
        if m == 0:
            return False
        n = len(board[0])  # 列数

        marked = [[False for _ in range(n)] for _ in range(m)]  # m*n
        for i in range(m):  # 行号
            for j in range(n):  # 列号
                # 对每一个格子都从头开始搜索
                if self.find_word(board, word, 0, i, j, marked, m, n):
                    return True
        return False

    def find_word(self, board, word, index,
                      start_x, start_y, marked, m, n):
        '''
        :param index: 单词下标
        '''
        # 先写递归终止条件
        if index == len(word) - 1:
            return board[start_x][start_y] == word[index]

        # 中间匹配了，再继续搜索
        if board[start_x][start_y] == word[index]:
            # 先占住这个位置，搜索不成功的话，要释放掉
            marked[start_x][start_y] = True
            for direction in self.directions:
                new_x = start_x + direction[0]
                new_y = start_y + direction[1]
                # 注意：如果这一次 search word 成功的话，就返回
                if 0 <= new_x < m and 0 <= new_y < n and not marked[new_x][new_y] \
                        and self.find_word(board, word, index + 1, new_x, new_y, marked, m, n):

                    return True
            marked[start_x][start_y] = False
        return False

board = [
  ['A','B','C','E'],
  ['S','F','C','S'],
  ['A','D','E','E']]
word = 'ABCCED'
s = Solution()
print(s.exist(board, word))

https://leetcode-cn.com/problems/word-search/solution/zai-er-wei-ping-mian-shang-shi-yong-hui-su-fa-pyth/