<?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%B7%AE%E5%88%86%E6%95%B0%E7%BB%84/</link>
    <description>Recent content in 差分数组 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 23:50:29 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E5%B7%AE%E5%88%86%E6%95%B0%E7%BB%84/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>差分数组为何能用两次操作完成区间修改从前缀和逆运算到LeetCode完整通关指南</title>
      <link>https://answer.freetools.me/%E5%B7%AE%E5%88%86%E6%95%B0%E7%BB%84%E4%B8%BA%E4%BD%95%E8%83%BD%E7%94%A8%E4%B8%A4%E6%AC%A1%E6%93%8D%E4%BD%9C%E5%AE%8C%E6%88%90%E5%8C%BA%E9%97%B4%E4%BF%AE%E6%94%B9%E4%BB%8E%E5%89%8D%E7%BC%80%E5%92%8C%E9%80%86%E8%BF%90%E7%AE%97%E5%88%B0leetcode%E5%AE%8C%E6%95%B4%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</link>
      <pubDate>Sun, 08 Mar 2026 23:50:29 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%B7%AE%E5%88%86%E6%95%B0%E7%BB%84%E4%B8%BA%E4%BD%95%E8%83%BD%E7%94%A8%E4%B8%A4%E6%AC%A1%E6%93%8D%E4%BD%9C%E5%AE%8C%E6%88%90%E5%8C%BA%E9%97%B4%E4%BF%AE%E6%94%B9%E4%BB%8E%E5%89%8D%E7%BC%80%E5%92%8C%E9%80%86%E8%BF%90%E7%AE%97%E5%88%B0leetcode%E5%AE%8C%E6%95%B4%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</guid>
      <description>差分数组是前缀和的逆运算，能够将区间修改的时间复杂度从O(n)降到O(1)。本文从原理出发，详解LeetCode 370、1109、1094、1526、1589、2381、3355等经典题目的Java解法。</description>
    </item>
    <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>
