<?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/categories/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/</link>
    <description>Recent content in 数据结构与算法 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 23:29:44 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/categories/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>字符串哈希如何用O(1)时间判断两个子串是否相等</title>
      <link>https://answer.freetools.me/%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%93%88%E5%B8%8C%E5%A6%82%E4%BD%95%E7%94%A8o1%E6%97%B6%E9%97%B4%E5%88%A4%E6%96%AD%E4%B8%A4%E4%B8%AA%E5%AD%90%E4%B8%B2%E6%98%AF%E5%90%A6%E7%9B%B8%E7%AD%89/</link>
      <pubDate>Sun, 08 Mar 2026 23:29:44 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%93%88%E5%B8%8C%E5%A6%82%E4%BD%95%E7%94%A8o1%E6%97%B6%E9%97%B4%E5%88%A4%E6%96%AD%E4%B8%A4%E4%B8%AA%E5%AD%90%E4%B8%B2%E6%98%AF%E5%90%A6%E7%9B%B8%E7%AD%89/</guid>
      <description>深入解析字符串哈希的核心原理与滚动哈希优化，从多项式哈希的数学基础到Rabin-Karp算法的工程实现，完整覆盖LeetCode经典题目的Java解法，包括最长重复子串、重复DNA序列、最长重复子数组等核心问题的分治与二分优化方案。</description>
    </item>
    <item>
      <title>HNSW：为什么这个图算法正在统治AI时代的向量检索</title>
      <link>https://answer.freetools.me/hnsw%E4%B8%BA%E4%BB%80%E4%B9%88%E8%BF%99%E4%B8%AA%E5%9B%BE%E7%AE%97%E6%B3%95%E6%AD%A3%E5%9C%A8%E7%BB%9F%E6%B2%BBai%E6%97%B6%E4%BB%A3%E7%9A%84%E5%90%91%E9%87%8F%E6%A3%80%E7%B4%A2/</link>
      <pubDate>Sun, 08 Mar 2026 17:04:51 +0800</pubDate>
      <guid>https://answer.freetools.me/hnsw%E4%B8%BA%E4%BB%80%E4%B9%88%E8%BF%99%E4%B8%AA%E5%9B%BE%E7%AE%97%E6%B3%95%E6%AD%A3%E5%9C%A8%E7%BB%9F%E6%B2%BBai%E6%97%B6%E4%BB%A3%E7%9A%84%E5%90%91%E9%87%8F%E6%A3%80%E7%B4%A2/</guid>
      <description>深入解析HNSW（分层可导航小世界）算法的设计哲学与实现原理。从六度分隔理论到可导航小世界图，从NSW的贪心路由到HNSW的分层结构，揭示这个算法如何在RAG系统、推荐引擎和语义搜索中实现毫秒级检索。涵盖参数调优、内存权衡、与其他索引的对比，以及大规模部署中的挑战与优化策略。</description>
    </item>
    <item>
      <title>Roaring Bitmaps：为什么这种压缩位图正在重塑大数据分析的存储范式</title>
      <link>https://answer.freetools.me/roaring-bitmaps%E4%B8%BA%E4%BB%80%E4%B9%88%E8%BF%99%E7%A7%8D%E5%8E%8B%E7%BC%A9%E4%BD%8D%E5%9B%BE%E6%AD%A3%E5%9C%A8%E9%87%8D%E5%A1%91%E5%A4%A7%E6%95%B0%E6%8D%AE%E5%88%86%E6%9E%90%E7%9A%84%E5%AD%98%E5%82%A8%E8%8C%83%E5%BC%8F/</link>
      <pubDate>Sun, 08 Mar 2026 16:42:56 +0800</pubDate>
      <guid>https://answer.freetools.me/roaring-bitmaps%E4%B8%BA%E4%BB%80%E4%B9%88%E8%BF%99%E7%A7%8D%E5%8E%8B%E7%BC%A9%E4%BD%8D%E5%9B%BE%E6%AD%A3%E5%9C%A8%E9%87%8D%E5%A1%91%E5%A4%A7%E6%95%B0%E6%8D%AE%E5%88%86%E6%9E%90%E7%9A%84%E5%AD%98%E5%82%A8%E8%8C%83%E5%BC%8F/</guid>
      <description>深入解析Roaring Bitmaps的设计哲学与实现原理，探讨其如何通过分块压缩和动态容器选择解决传统位图的稀疏存储困境，以及在Elasticsearch、ClickHouse等系统中的实际应用。</description>
    </item>
    <item>
      <title>为什么主流语言的sort函数都选择了Timsort</title>
      <link>https://answer.freetools.me/%E4%B8%BA%E4%BB%80%E4%B9%88%E4%B8%BB%E6%B5%81%E8%AF%AD%E8%A8%80%E7%9A%84sort%E5%87%BD%E6%95%B0%E9%83%BD%E9%80%89%E6%8B%A9%E4%BA%86timsort/</link>
      <pubDate>Sun, 08 Mar 2026 16:35:21 +0800</pubDate>
      <guid>https://answer.freetools.me/%E4%B8%BA%E4%BB%80%E4%B9%88%E4%B8%BB%E6%B5%81%E8%AF%AD%E8%A8%80%E7%9A%84sort%E5%87%BD%E6%95%B0%E9%83%BD%E9%80%89%E6%8B%A9%E4%BA%86timsort/</guid>
      <description>深入分析Timsort排序算法的设计哲学与实现原理，探讨为何Python、Java等语言放弃快速排序而选择这一混合算法，揭示其对真实世界数据的适应性优势。</description>
    </item>
  </channel>
</rss>
