当前标签：Trie

LeetCode 3076. Shortest Uncommon Substring in an Array
Dylan_Java_NYC 2024-08-04 04:32 阅读:94 评论:0 推荐:0
LeetCode 1166. Design File System
Dylan_Java_NYC 2022-08-28 09:03 阅读:298 评论:0 推荐:0
LeetCode 588. Design In-Memory File System
Dylan_Java_NYC 2022-07-24 12:36 阅读:300 评论:0 推荐:0
LeetCode 745. Prefix and Suffix Search
Dylan_Java_NYC 2021-03-05 15:06 阅读:185 评论:0 推荐:0
LeetCode 472. Concatenated Words
Dylan_Java_NYC 2020-01-13 03:17 阅读:388 评论:0 推荐:0
LeetCode 1032. Stream of Characters
Dylan_Java_NYC 2020-01-02 11:57 阅读:423 评论:0 推荐:0
LeetCode 642. Design Search Autocomplete System
Dylan_Java_NYC 2019-12-27 07:59 阅读:403 评论:0 推荐:0
LeetCode 1023. Camelcase Matching
Dylan_Java_NYC 2019-11-14 11:47 阅读:253 评论:0 推荐:0
LeetCode 677. Map Sum Pairs
Dylan_Java_NYC 2019-11-13 13:10 阅读:293 评论:0 推荐:0
LeetCode 676. Implement Magic Dictionary
Dylan_Java_NYC 2019-11-13 12:46 阅读:273 评论:0 推荐:0
LeetCode 648. Replace Words
Dylan_Java_NYC 2017-11-13 10:16 阅读:374 评论:0 推荐:0
LeetCode 692. Top K Frequent Words
Dylan_Java_NYC 2017-10-26 07:26 阅读:610 评论:0 推荐:0
LeetCode 421. Maximum XOR of Two Numbers in an Array
Dylan_Java_NYC 2017-02-01 08:41 阅读:524 评论:0 推荐:0
LeetCode 212. Word Search II
Dylan_Java_NYC 2015-11-07 09:11 阅读:1458 评论:0 推荐:0
LeetCode 211. Design Add and Search Words Data Structure
Dylan_Java_NYC 2015-11-03 12:07 阅读:559 评论:0 推荐:0
LeetCode 208. Implement Trie (Prefix Tree)
Dylan_Java_NYC 2015-10-18 07:14 阅读:546 评论:0 推荐:0