单词搜索II 150
困难字节跳动DFS
题目描述
给定一个 m x n 的字符网格 board 和一个单词列表 words，请找出同时存在于网格中的所有单词。单词必须按照字母顺序通过相邻的单元格（水平或垂直相邻）构成，同一个单元格内的字母在同一单词中不允许被重复使用。请使用 Trie 数据结构优化搜索。
示例
输入:
board = [["o","a","a","n"],["e","t","a","e"],["i","h","k","r"],["i","f","l","v"]], words = ["oath","pea","eat","rain"]输出:
["eat","oath"]solution.ts
输出结果
点击「运行代码」按钮查看结果...