<?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%93%88%E5%B8%8C%E8%A1%A8/</link>
    <description>Recent content in 哈希表 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 19:56:18 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E5%93%88%E5%B8%8C%E8%A1%A8/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>前缀和算法如何用一次预处理换来O(1)区间查询</title>
      <link>https://answer.freetools.me/%E5%89%8D%E7%BC%80%E5%92%8C%E7%AE%97%E6%B3%95%E5%A6%82%E4%BD%95%E7%94%A8%E4%B8%80%E6%AC%A1%E9%A2%84%E5%A4%84%E7%90%86%E6%8D%A2%E6%9D%A5o1%E5%8C%BA%E9%97%B4%E6%9F%A5%E8%AF%A2/</link>
      <pubDate>Sun, 08 Mar 2026 19:56:18 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%89%8D%E7%BC%80%E5%92%8C%E7%AE%97%E6%B3%95%E5%A6%82%E4%BD%95%E7%94%A8%E4%B8%80%E6%AC%A1%E9%A2%84%E5%A4%84%E7%90%86%E6%8D%A2%E6%9D%A5o1%E5%8C%BA%E9%97%B4%E6%9F%A5%E8%AF%A2/</guid>
      <description>一篇系统讲解前缀和算法的深度教程，从一维前缀和到二维矩阵前缀和，再到前缀和与哈希表的经典结合模式。结合LeetCode经典题目（303/304/560/974/523/437/1248等）的完整Java实现与复杂度分析，帮助你彻底掌握这一面试高频算法模式。</description>
    </item>
    <item>
      <title>哈希表的七十年演进：从链表法到Swiss Table的工程智慧</title>
      <link>https://answer.freetools.me/%E5%93%88%E5%B8%8C%E8%A1%A8%E7%9A%84%E4%B8%83%E5%8D%81%E5%B9%B4%E6%BC%94%E8%BF%9B%E4%BB%8E%E9%93%BE%E8%A1%A8%E6%B3%95%E5%88%B0swiss-table%E7%9A%84%E5%B7%A5%E7%A8%8B%E6%99%BA%E6%85%A7/</link>
      <pubDate>Sat, 07 Mar 2026 17:39:22 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%93%88%E5%B8%8C%E8%A1%A8%E7%9A%84%E4%B8%83%E5%8D%81%E5%B9%B4%E6%BC%94%E8%BF%9B%E4%BB%8E%E9%93%BE%E8%A1%A8%E6%B3%95%E5%88%B0swiss-table%E7%9A%84%E5%B7%A5%E7%A8%8B%E6%99%BA%E6%85%A7/</guid>
      <description>深入解析哈希表的七十年技术演进：从1953年Hans Peter Luhn的开创性工作到现代Swiss Table的SIMD优化。系统梳理链表法与开放寻址的博弈，Robin Hood、Cuckoo、Hopscotch等算法的创新，以及Java、Python、Rust、Go等主流语言的实现选择。揭示哈希表如何在缓存效率、内存布局和冲突处理之间寻找最优平衡点。</description>
    </item>
    <item>
      <title>哈希碰撞攻击：为何一条HTTP请求能让服务器CPU飙升到100%</title>
      <link>https://answer.freetools.me/%E5%93%88%E5%B8%8C%E7%A2%B0%E6%92%9E%E6%94%BB%E5%87%BB%E4%B8%BA%E4%BD%95%E4%B8%80%E6%9D%A1http%E8%AF%B7%E6%B1%82%E8%83%BD%E8%AE%A9%E6%9C%8D%E5%8A%A1%E5%99%A8cpu%E9%A3%99%E5%8D%87%E5%88%B0100/</link>
      <pubDate>Thu, 05 Mar 2026 16:55:02 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%93%88%E5%B8%8C%E7%A2%B0%E6%92%9E%E6%94%BB%E5%87%BB%E4%B8%BA%E4%BD%95%E4%B8%80%E6%9D%A1http%E8%AF%B7%E6%B1%82%E8%83%BD%E8%AE%A9%E6%9C%8D%E5%8A%A1%E5%99%A8cpu%E9%A3%99%E5%8D%87%E5%88%B0100/</guid>
      <description>深入解析哈希碰撞DoS攻击的技术原理：从2003年Crosby和Wallach的开创性论文到2011年横扫主流语言的安全危机，揭示确定性哈希函数如何将O(1)操作变成O(n²)灾难，以及SipHash如何成为现代语言的标准防线。</description>
    </item>
  </channel>
</rss>
