<?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>Binary Indexed Tree on Answer</title>
    <link>https://answer.freetools.me/tags/binary-indexed-tree/</link>
    <description>Recent content in Binary Indexed Tree on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 22:29:37 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/binary-indexed-tree/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>树状数组：用最少的代码实现最高效的区间查询从lowbit到LeetCode完整通关指南</title>
      <link>https://answer.freetools.me/%E6%A0%91%E7%8A%B6%E6%95%B0%E7%BB%84%E7%94%A8%E6%9C%80%E5%B0%91%E7%9A%84%E4%BB%A3%E7%A0%81%E5%AE%9E%E7%8E%B0%E6%9C%80%E9%AB%98%E6%95%88%E7%9A%84%E5%8C%BA%E9%97%B4%E6%9F%A5%E8%AF%A2%E4%BB%8Elowbit%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 22:29:37 +0800</pubDate>
      <guid>https://answer.freetools.me/%E6%A0%91%E7%8A%B6%E6%95%B0%E7%BB%84%E7%94%A8%E6%9C%80%E5%B0%91%E7%9A%84%E4%BB%A3%E7%A0%81%E5%AE%9E%E7%8E%B0%E6%9C%80%E9%AB%98%E6%95%88%E7%9A%84%E5%8C%BA%E9%97%B4%E6%9F%A5%E8%AF%A2%E4%BB%8Elowbit%E5%88%B0leetcode%E5%AE%8C%E6%95%B4%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</guid>
      <description>深度解析树状数组的核心原理，从Peter Fenwick 1994年的原始论文到lowbit操作的数学本质，涵盖单点更新、区间查询、逆序对计数等经典应用，并通过LeetCode 307/315/493/327/1649等题目的Java完整解法，带你掌握这个简洁优雅的数据结构。</description>
    </item>
  </channel>
</rss>
