友情支持

如果您觉得这个笔记对您有所帮助，看在D瓜哥码这么多字的辛苦上，请友情支持一下，D瓜哥感激不尽，😜

支付宝

微信

有些打赏的朋友希望可以加个好友，欢迎关注D 瓜哥的微信公众号，这样就可以通过公众号的回复直接给我发信息。

wx jikerizhi

公众号的微信号是: jikerizhi。因为众所周知的原因，有时图片加载不出来。 如果图片加载不出来可以直接通过搜索微信号来查找我的公众号。

Trie 前缀树

经典题目

  1. 14. Longest Common Prefix

  2. 139. 单词拆分

  3. 140. 单词拆分 II

  4. 208. 实现 Trie (前缀树)

  5. [0211-design-add-and-search-words-data-structure]

  6. [0212-word-search-ii]

  7. [0336-palindrome-pairs]

  8. [0386-lexicographical-numbers]

  9. [0421-maximum-xor-of-two-numbers-in-an-array]

  10. [0425-word-squares]

  11. [0440-k-th-smallest-in-lexicographical-order]

  12. [0472-concatenated-words]

  13. [0527-word-abbreviation]

  14. [0588-design-in-memory-file-system]

  15. [0616-add-bold-tag-in-string]

  16. [0642-design-search-autocomplete-system]

  17. [0648-replace-words]

  18. [0676-implement-magic-dictionary]

  19. [0677-map-sum-pairs]

  20. [0692-top-k-frequent-words]

  21. [0720-longest-word-in-dictionary]

  22. [0745-prefix-and-suffix-search]

  23. [0758-bold-words-in-string]

  24. [0792-number-of-matching-subsequences]

  25. [0820-short-encoding-of-words]

  26. [1023-camelcase-matching]

  27. [1032-stream-of-characters]

  28. [1065-index-pairs-of-a-string]

  29. [1166-design-file-system]

  30. [1178-number-of-valid-words-for-each-puzzle]

  31. [1233-remove-sub-folders-from-the-filesystem]

  32. [1268-search-suggestions-system]

  33. [1316-distinct-echo-substrings]

  34. [1698-number-of-distinct-substrings-in-a-string]

  35. [1707-maximum-xor-with-an-element-from-array]

  36. [1803-count-pairs-with-xor-in-a-range]

  37. [1804-implement-trie-ii-prefix-tree]

  38. [1858-longest-word-with-all-prefixes]

  39. [1938-maximum-genetic-difference-query]

  40. [1948-delete-duplicate-folders-in-system]

  41. [2227-encrypt-and-decrypt-strings]

  42. [2261-k-divisible-elements-subarrays]

  43. [2416-sum-of-prefix-scores-of-strings]

  44. [2452-words-within-two-edits-of-dictionary]

  45. [2479-maximum-xor-of-two-non-overlapping-subtrees]

  46. [2707-extra-characters-in-a-string]

  47. [2932-maximum-strong-pair-xor-i]

  48. [2935-maximum-strong-pair-xor-ii]

  49. [2977-minimum-cost-to-convert-string-ii]

  50. [3042-count-prefix-and-suffix-pairs-i]

  51. [3043-find-the-length-of-the-longest-common-prefix]

  52. [3045-count-prefix-and-suffix-pairs-ii]

  53. [3076-shortest-uncommon-substring-in-an-array]

  54. [3093-longest-common-suffix-queries]

  55. [3291-minimum-number-of-valid-strings-to-form-target-i]

  56. [3485-longest-common-prefix-of-k-strings-after-removal]

  57. [3491-phone-number-prefix]

参考资料

  1. 268. 丢失的数字 - 一题五解 :「排序」&「计数」&「原地哈希」&「数学」&「异或」

  2. 【设计数据结构】实现 Trie (前缀树)

  3. 【面试高频题】难度 4/5，常规解法与数据结构优化解法

  4. 【综合笔试题】结合贪心的 Trie 运用题

  5. 【综合笔试题】难度 4.5/5，借该问题来实现一个「可计数」的 Trie

← Previous: Depth First Search 深度优先搜索 | ↑ Up: LeetCode 解题笔记 | Next: Union Find Set 并查集 →