随笔分类 - Tries

212. Word Search II[Hard]

摘要：212. Word Search II Given an m x n board of characters and a list of strings words, return all words on the board. Each word must be constructed from 阅读全文

posted @ 2023-02-14 14:32 AaronTanooo 阅读(5) 评论(0) 推荐(0) 编辑

211. Design Add and Search Words Data Structure[Medium]

摘要：211. Design Add and Search Words Data Structure Design a data structure that supports adding new words and finding if a string matches any previously 阅读全文

posted @ 2023-02-14 13:14 AaronTanooo 阅读(21) 评论(0) 推荐(0) 编辑

208. Implement Trie (Prefix Tree)[Medium]

摘要：208. Implement Trie (Prefix Tree) A trie (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in 阅读全文

posted @ 2023-02-14 13:03 AaronTanooo 阅读(11) 评论(0) 推荐(0) 编辑