<?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/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/</link>
    <description>Recent content in 数据结构 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Fri, 13 Mar 2026 14:21:23 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>HyperLogLog：用1.5KB内存估算十亿级基数的概率魔法</title>
      <link>https://answer.freetools.me/hyperloglog%E7%94%A81.5kb%E5%86%85%E5%AD%98%E4%BC%B0%E7%AE%97%E5%8D%81%E4%BA%BF%E7%BA%A7%E5%9F%BA%E6%95%B0%E7%9A%84%E6%A6%82%E7%8E%87%E9%AD%94%E6%B3%95/</link>
      <pubDate>Fri, 13 Mar 2026 14:21:23 +0800</pubDate>
      <guid>https://answer.freetools.me/hyperloglog%E7%94%A81.5kb%E5%86%85%E5%AD%98%E4%BC%B0%E7%AE%97%E5%8D%81%E4%BA%BF%E7%BA%A7%E5%9F%BA%E6%95%B0%E7%9A%84%E6%A6%82%E7%8E%87%E9%AD%94%E6%B3%95/</guid>
      <description>深入解析HyperLogLog算法如何用极小内存实现大规模数据基数估计，从Flajolet-Martin到Google HLL&#43;&#43;的二十年演进，揭示概率算法的数学之美与工程智慧</description>
    </item>
    <item>
      <title>链表算法为何让无数开发者头疼从指针陷阱到快慢指针的完整LeetCode通关指南</title>
      <link>https://answer.freetools.me/%E9%93%BE%E8%A1%A8%E7%AE%97%E6%B3%95%E4%B8%BA%E4%BD%95%E8%AE%A9%E6%97%A0%E6%95%B0%E5%BC%80%E5%8F%91%E8%80%85%E5%A4%B4%E7%96%BC%E4%BB%8E%E6%8C%87%E9%92%88%E9%99%B7%E9%98%B1%E5%88%B0%E5%BF%AB%E6%85%A2%E6%8C%87%E9%92%88%E7%9A%84%E5%AE%8C%E6%95%B4leetcode%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</link>
      <pubDate>Sun, 08 Mar 2026 23:08:48 +0800</pubDate>
      <guid>https://answer.freetools.me/%E9%93%BE%E8%A1%A8%E7%AE%97%E6%B3%95%E4%B8%BA%E4%BD%95%E8%AE%A9%E6%97%A0%E6%95%B0%E5%BC%80%E5%8F%91%E8%80%85%E5%A4%B4%E7%96%BC%E4%BB%8E%E6%8C%87%E9%92%88%E9%99%B7%E9%98%B1%E5%88%B0%E5%BF%AB%E6%85%A2%E6%8C%87%E9%92%88%E7%9A%84%E5%AE%8C%E6%95%B4leetcode%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</guid>
      <description>一篇深度讲解链表算法的完整指南，从历史背景到核心概念，涵盖虚拟头节点、双指针、快慢指针、反转链表等核心技巧，结合LeetCode经典题目（206/141/142/21/19/876/160/234/143/148/25/138等）的完整Java实现与复杂度分析。</description>
    </item>
    <item>
      <title>线段树：如何在O(log n)时间内完成任意区间查询与更新</title>
      <link>https://answer.freetools.me/%E7%BA%BF%E6%AE%B5%E6%A0%91%E5%A6%82%E4%BD%95%E5%9C%A8olog-n%E6%97%B6%E9%97%B4%E5%86%85%E5%AE%8C%E6%88%90%E4%BB%BB%E6%84%8F%E5%8C%BA%E9%97%B4%E6%9F%A5%E8%AF%A2%E4%B8%8E%E6%9B%B4%E6%96%B0/</link>
      <pubDate>Sun, 08 Mar 2026 21:08:55 +0800</pubDate>
      <guid>https://answer.freetools.me/%E7%BA%BF%E6%AE%B5%E6%A0%91%E5%A6%82%E4%BD%95%E5%9C%A8olog-n%E6%97%B6%E9%97%B4%E5%86%85%E5%AE%8C%E6%88%90%E4%BB%BB%E6%84%8F%E5%8C%BA%E9%97%B4%E6%9F%A5%E8%AF%A2%E4%B8%8E%E6%9B%B4%E6%96%B0/</guid>
      <description>深度解析线段树数据结构的核心原理，涵盖构建、查询、更新、懒惰传播等关键操作，并通过LeetCode经典题目（307/315/327/493等）的Java解法，带你掌握区间问题的高效解决方案。</description>
    </item>
    <item>
      <title>并查集：从社交网络连通性到LeetCode通关的完整指南</title>
      <link>https://answer.freetools.me/%E5%B9%B6%E6%9F%A5%E9%9B%86%E4%BB%8E%E7%A4%BE%E4%BA%A4%E7%BD%91%E7%BB%9C%E8%BF%9E%E9%80%9A%E6%80%A7%E5%88%B0leetcode%E9%80%9A%E5%85%B3%E7%9A%84%E5%AE%8C%E6%95%B4%E6%8C%87%E5%8D%97/</link>
      <pubDate>Sun, 08 Mar 2026 20:39:07 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%B9%B6%E6%9F%A5%E9%9B%86%E4%BB%8E%E7%A4%BE%E4%BA%A4%E7%BD%91%E7%BB%9C%E8%BF%9E%E9%80%9A%E6%80%A7%E5%88%B0leetcode%E9%80%9A%E5%85%B3%E7%9A%84%E5%AE%8C%E6%95%B4%E6%8C%87%E5%8D%97/</guid>
      <description>一篇系统讲解并查集数据结构的深度教程，从核心原理到路径压缩与按秩合并的优化技巧，结合LeetCode经典题目（547/684/721/990/765/947/1202/1319/952/1697等）的完整Java实现与复杂度分析，帮助彻底掌握这一面试高频数据结构。</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>时间轮如何以O(1)复杂度处理百万级延迟任务</title>
      <link>https://answer.freetools.me/%E6%97%B6%E9%97%B4%E8%BD%AE%E5%A6%82%E4%BD%95%E4%BB%A5o1%E5%A4%8D%E6%9D%82%E5%BA%A6%E5%A4%84%E7%90%86%E7%99%BE%E4%B8%87%E7%BA%A7%E5%BB%B6%E8%BF%9F%E4%BB%BB%E5%8A%A1/</link>
      <pubDate>Sat, 07 Mar 2026 14:58:32 +0800</pubDate>
      <guid>https://answer.freetools.me/%E6%97%B6%E9%97%B4%E8%BD%AE%E5%A6%82%E4%BD%95%E4%BB%A5o1%E5%A4%8D%E6%9D%82%E5%BA%A6%E5%A4%84%E7%90%86%E7%99%BE%E4%B8%87%E7%BA%A7%E5%BB%B6%E8%BF%9F%E4%BB%BB%E5%8A%A1/</guid>
      <description>深入解析延迟队列的实现原理：从数据库轮询到最小堆，再到时间轮算法的演进历程。追溯1987年Varghese和Lauck的开创性论文，剖析Kafka层级时间轮的设计思想，解读Linux内核2015年重新设计时间轮的原因，比较时间轮、最小堆、Redis ZSet、消息队列延迟消息等多种方案的权衡与适用场景。</description>
    </item>
    <item>
      <title>打开一个500MB的文件需要多久：从字符串到Piece Tree的文本编辑器数据结构进化史</title>
      <link>https://answer.freetools.me/%E6%89%93%E5%BC%80%E4%B8%80%E4%B8%AA500mb%E7%9A%84%E6%96%87%E4%BB%B6%E9%9C%80%E8%A6%81%E5%A4%9A%E4%B9%85%E4%BB%8E%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%88%B0piece-tree%E7%9A%84%E6%96%87%E6%9C%AC%E7%BC%96%E8%BE%91%E5%99%A8%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E8%BF%9B%E5%8C%96%E5%8F%B2/</link>
      <pubDate>Sat, 07 Mar 2026 05:38:53 +0800</pubDate>
      <guid>https://answer.freetools.me/%E6%89%93%E5%BC%80%E4%B8%80%E4%B8%AA500mb%E7%9A%84%E6%96%87%E4%BB%B6%E9%9C%80%E8%A6%81%E5%A4%9A%E4%B9%85%E4%BB%8E%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%88%B0piece-tree%E7%9A%84%E6%96%87%E6%9C%AC%E7%BC%96%E8%BE%91%E5%99%A8%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E8%BF%9B%E5%8C%96%E5%8F%B2/</guid>
      <description>深入剖析文本编辑器背后的数据结构演进。从简单的字符串到Gap Buffer、Piece Table、Rope，再到VSCode的Piece Tree和Zed的SumTree，揭示为什么打开大文件曾是开发者的噩梦，以及现代编辑器如何通过精巧的数据结构设计实现毫秒级响应。涵盖Emacs、Vim、VSCode、Sublime、Zed等主流编辑器的技术选型与权衡。</description>
    </item>
    <item>
      <title>没有完美的数据结构：从时空权衡到缓存友好的选择之道</title>
      <link>https://answer.freetools.me/%E6%B2%A1%E6%9C%89%E5%AE%8C%E7%BE%8E%E7%9A%84%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%BB%8E%E6%97%B6%E7%A9%BA%E6%9D%83%E8%A1%A1%E5%88%B0%E7%BC%93%E5%AD%98%E5%8F%8B%E5%A5%BD%E7%9A%84%E9%80%89%E6%8B%A9%E4%B9%8B%E9%81%93/</link>
      <pubDate>Fri, 06 Mar 2026 03:33:11 +0800</pubDate>
      <guid>https://answer.freetools.me/%E6%B2%A1%E6%9C%89%E5%AE%8C%E7%BE%8E%E7%9A%84%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%BB%8E%E6%97%B6%E7%A9%BA%E6%9D%83%E8%A1%A1%E5%88%B0%E7%BC%93%E5%AD%98%E5%8F%8B%E5%A5%BD%E7%9A%84%E9%80%89%E6%8B%A9%E4%B9%8B%E9%81%93/</guid>
      <description>深入解析数据结构选择的底层逻辑。从B树与LSM树的数据库之争，到跳表为何成为Redis的选择，系统梳理时间复杂度、空间复杂度与缓存性能之间的多维权衡。基于真实系统的工程实践，剖析数据结构选型的决策框架。</description>
    </item>
    <item>
      <title>B&#43;树与LSM-tree：为什么数据库存储引擎没有万能方案</title>
      <link>https://answer.freetools.me/b-%E6%A0%91%E4%B8%8Elsm-tree%E4%B8%BA%E4%BB%80%E4%B9%88%E6%95%B0%E6%8D%AE%E5%BA%93%E5%AD%98%E5%82%A8%E5%BC%95%E6%93%8E%E6%B2%A1%E6%9C%89%E4%B8%87%E8%83%BD%E6%96%B9%E6%A1%88/</link>
      <pubDate>Fri, 06 Mar 2026 02:06:37 +0800</pubDate>
      <guid>https://answer.freetools.me/b-%E6%A0%91%E4%B8%8Elsm-tree%E4%B8%BA%E4%BB%80%E4%B9%88%E6%95%B0%E6%8D%AE%E5%BA%93%E5%AD%98%E5%82%A8%E5%BC%95%E6%93%8E%E6%B2%A1%E6%9C%89%E4%B8%87%E8%83%BD%E6%96%B9%E6%A1%88/</guid>
      <description>深入分析 B&#43; 树与 LSM 树存储引擎的核心权衡。从写放大、读放大、空间放大三个维度定量比较，揭示为什么数据库存储引擎没有万能方案，以及如何根据工作负载选择正确的存储引擎。</description>
    </item>
  </channel>
</rss>
