<?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/%E7%BA%BF%E6%AE%B5%E6%A0%91/</link>
    <description>Recent content in 线段树 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 23:45:39 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E7%BA%BF%E6%AE%B5%E6%A0%91/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>扫描线算法如何将二维问题降维成一维从天际线到矩形面积的LeetCode完整通关指南</title>
      <link>https://answer.freetools.me/%E6%89%AB%E6%8F%8F%E7%BA%BF%E7%AE%97%E6%B3%95%E5%A6%82%E4%BD%95%E5%B0%86%E4%BA%8C%E7%BB%B4%E9%97%AE%E9%A2%98%E9%99%8D%E7%BB%B4%E6%88%90%E4%B8%80%E7%BB%B4%E4%BB%8E%E5%A4%A9%E9%99%85%E7%BA%BF%E5%88%B0%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF%E7%9A%84leetcode%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:45:39 +0800</pubDate>
      <guid>https://answer.freetools.me/%E6%89%AB%E6%8F%8F%E7%BA%BF%E7%AE%97%E6%B3%95%E5%A6%82%E4%BD%95%E5%B0%86%E4%BA%8C%E7%BB%B4%E9%97%AE%E9%A2%98%E9%99%8D%E7%BB%B4%E6%88%90%E4%B8%80%E7%BB%B4%E4%BB%8E%E5%A4%A9%E9%99%85%E7%BA%BF%E5%88%B0%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF%E7%9A%84leetcode%E5%AE%8C%E6%95%B4%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</guid>
      <description>深度解析扫描线算法的核心原理与应用，从1976年Shamos-Hoey算法的历史突破到LeetCode经典题目的完整Java解法。覆盖一维区间问题（会议室调度、人口统计、拼车问题）和二维几何问题（天际线、矩形面积并集、完美矩形、下落的方块），揭示事件驱动扫描的统一框架与降维艺术。</description>
    </item>
    <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>
