<?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>Prefix Sum on Answer</title>
    <link>https://answer.freetools.me/tags/prefix-sum/</link>
    <description>Recent content in Prefix Sum 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/prefix-sum/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>
  </channel>
</rss>
