<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>字典树 on Answer</title>
    <link>https://answer.freetools.me/tags/%E5%AD%97%E5%85%B8%E6%A0%91/</link>
    <description>Recent content in 字典树 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 20:47:56 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E5%AD%97%E5%85%B8%E6%A0%91/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>字典树（Trie）：用共享前缀把字符串检索从O(n)降到O(L)</title>
      <link>https://answer.freetools.me/%E5%AD%97%E5%85%B8%E6%A0%91trie%E7%94%A8%E5%85%B1%E4%BA%AB%E5%89%8D%E7%BC%80%E6%8A%8A%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%A3%80%E7%B4%A2%E4%BB%8Eon%E9%99%8D%E5%88%B0ol/</link>
      <pubDate>Sun, 08 Mar 2026 20:47:56 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%AD%97%E5%85%B8%E6%A0%91trie%E7%94%A8%E5%85%B1%E4%BA%AB%E5%89%8D%E7%BC%80%E6%8A%8A%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%A3%80%E7%B4%A2%E4%BB%8Eon%E9%99%8D%E5%88%B0ol/</guid>
      <description>一篇系统讲解字典树(Trie)数据结构的深度教程，从核心原理到LeetCode经典题目（208/211/212/421/648/677/720/1268等）的完整Java实现与复杂度分析，涵盖前缀匹配、自动补全、IP路由等实际应用场景。</description>
    </item>
  </channel>
</rss>
