单词搜索II
困难美团回溯
题目描述
给定一个m×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"]输出:
["oath","eat"]solution.ts
输出结果
点击「运行代码」按钮查看结果...