<?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%8F%8C%E7%AB%AF%E9%98%9F%E5%88%97/</link>
    <description>Recent content in 双端队列 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 22:44:34 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E5%8F%8C%E7%AB%AF%E9%98%9F%E5%88%97/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>单调队列算法如何在滑动窗口中保持O(n)时间复杂度</title>
      <link>https://answer.freetools.me/%E5%8D%95%E8%B0%83%E9%98%9F%E5%88%97%E7%AE%97%E6%B3%95%E5%A6%82%E4%BD%95%E5%9C%A8%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E4%B8%AD%E4%BF%9D%E6%8C%81on%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6/</link>
      <pubDate>Sun, 08 Mar 2026 22:44:34 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%8D%95%E8%B0%83%E9%98%9F%E5%88%97%E7%AE%97%E6%B3%95%E5%A6%82%E4%BD%95%E5%9C%A8%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E4%B8%AD%E4%BF%9D%E6%8C%81on%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6/</guid>
      <description>一篇系统讲解单调队列算法的深度教程，从核心原理到两种类型（单调递增/递减队列），结合LeetCode经典题目（239/862/1438/1696等）的完整Java实现与复杂度分析，帮助你彻底掌握这一面试高频算法模式。</description>
    </item>
  </channel>
</rss>
