<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>LeetCode on 知识铺的博客</title>
    <link>https://index.zshipu.com/geek/tags/LeetCode/</link>
    <description>Recent content in LeetCode on 知识铺的博客</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>zh-CN</language>
    <lastBuildDate>Thu, 20 Aug 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://index.zshipu.com/geek/tags/LeetCode/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>滑动窗口最大值：从暴力超时到单调队列优化</title>
      <link>https://index.zshipu.com/geek/post/20260820/%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E6%9C%80%E5%A4%A7%E5%80%BC%E4%BB%8E%E6%9A%B4%E5%8A%9B%E8%B6%85%E6%97%B6%E5%88%B0%E5%8D%95%E8%B0%83%E9%98%9F%E5%88%97%E4%BC%98%E5%8C%96/</link>
      <pubDate>Thu, 20 Aug 2026 00:00:00 +0000</pubDate>
      <guid>https://index.zshipu.com/geek/post/20260820/%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E6%9C%80%E5%A4%A7%E5%80%BC%E4%BB%8E%E6%9A%B4%E5%8A%9B%E8%B6%85%E6%97%B6%E5%88%B0%E5%8D%95%E8%B0%83%E9%98%9F%E5%88%97%E4%BC%98%E5%8C%96/</guid>
      <description>滑动窗口最大值：从暴力超时到单调队列优化 刷算法题时，滑动窗口问题很常见，但LeetCode 239题“滑动窗口最大值”却让不少人卡壳。很多人第一反应是写两层循环，结果一提交就超时。这篇文章就来聊聊如何用单调队列轻松解决这道hard题。 题目是什么 题目本身不复杂：给定一个数组和一个窗口</description>
    </item>
  </channel>
</rss>
