<?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%8C%BA%E9%97%B4%E6%9F%A5%E8%AF%A2/</link>
    <description>Recent content in 区间查询 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 21:08:55 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E5%8C%BA%E9%97%B4%E6%9F%A5%E8%AF%A2/index.xml" rel="self" type="application/rss+xml" />
    <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>
  </channel>
</rss>
