[LeetCode]212. 单词搜索 II

212. 单词搜索 II

难度：困难

给定一个 m x n 二维字符网格 board 和一个单词（字符串）列表 words，找出所有同时在二维网格和字典中出现的单词。

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

示例 1：

输入：board = [["o","a","a","n"],["e","t","a","e"],["i","h","k","r"],["i","f","l","v"]], words = ["oath","pea","eat","rain"]
输出：["eat","oath"]

示例 2：

输入：board = [["a","b"],["c","d"]], words = ["abcb"]
输出：[]

提示：

• m == board.length
• n == board[i].length
• 1 <= m, n <= 12
• board[i][j] 是一个小写英文字母
• 1 <= words.length <= 3 * 104
• 1 <= words[i].length <= 10
• words[i] 由小写英文字母组成
• words 中的所有字符串互不相同

---

class Trie:
    def __init__(self):
        self.dic = {}

    def insert(self, word: str) -> None:
        node = self.dic
        for c in word:
            if c not in node:
                node[c] = {}
            node = node[c]

    def startsWith(self, prefix: str) -> bool:
        node = self.dic
        for c in prefix:
            if c not in node:
                return False
            node = node[c]
        return True

class Solution:
    def findWords(self, board: List[List[str]], words: List[str]) -> List[str]:
        res = set()
        visited = set()
        m, n = len(board), len(board[0])
        trie = Trie()

        for word in words:
            trie.insert(word)
        
        @cache
        def dfs(i, j, s):
            if not trie.startsWith(s):
                return
            if s in words:
                res.add(s)
            visited.add((i,j))
            for vi, vj in [[1,0],[-1,0],[0,1],[0,-1]]:
                newi, newj = vi + i, vj + j
                if m > newi >= 0 and n > newj >= 0 and (newi,newj) not in visited:
                    dfs(newi,newj,s + board[newi][newj])
            visited.remove((i,j))

        for i in range(m):
            for j in range(n):
                dfs(i, j, board[i][j])
        return list(res)