<?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>Monotonic Queue on LeetCode 题解笔记</title><link>https://leetcode-solutions-5zk.pages.dev/tags/monotonic-queue/</link><description>Recent content in Monotonic Queue on LeetCode 题解笔记</description><generator>Hugo</generator><language>zh-cn</language><copyright>2026 ZenzZwei</copyright><lastBuildDate>Mon, 11 May 2026 12:12:02 +0800</lastBuildDate><atom:link href="https://leetcode-solutions-5zk.pages.dev/tags/monotonic-queue/index.xml" rel="self" type="application/rss+xml"/><item><title>1687. 从仓库向港口运送箱子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1687-delivering-boxes-from-storage-to-ports/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1687-delivering-boxes-from-storage-to-ports/</guid><description>Hard | Array, Dynamic Programming, Segment Tree, Queue, Heap (Priority Queue), Prefix Sum, Monotonic Queue</description></item><item><title>2398. 预算内机器人的最大数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2398-maximum-number-of-robots-within-budget/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2398-maximum-number-of-robots-within-budget/</guid><description>Hard | Array, Binary Search, Queue, Sliding Window, Heap (Priority Queue), Prefix Sum, Monotonic Queue</description></item><item><title>1438. 绝对差不超过限制的最长连续子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/</guid><description>Medium | Array, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queue</description></item><item><title>3578. 计算最大值最小值差值不超过K的分割数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3578-count-partitions-with-max-min-difference-at-most-k/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3578-count-partitions-with-max-min-difference-at-most-k/</guid><description>Medium | Array, Dynamic Programming, Queue, Sliding Window, Prefix Sum, Monotonic Queue</description></item><item><title>3420. 经过 K 次操作后非递减子数组的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3420-count-non-decreasing-subarrays-after-k-operations/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3420-count-non-decreasing-subarrays-after-k-operations/</guid><description>Hard | Array, Stack, Segment Tree, Queue, Sliding Window, Monotonic Stack, Monotonic Queue</description></item><item><title>3589. 统计质数间隔平衡的子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3589-count-prime-gap-balanced-subarrays/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3589-count-prime-gap-balanced-subarrays/</guid><description>Medium | Array, Math, Queue, Sliding Window, Number Theory, Monotonic Queue</description></item><item><title>3826. 最小分割得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3826-minimum-partition-score/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3826-minimum-partition-score/</guid><description>Hard | Array, Divide and Conquer, Dynamic Programming, Queue, Prefix Sum, Monotonic Queue</description></item><item><title>3835. 统计花费小于等于 K 的子数组数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3835-count-subarrays-with-cost-less-than-or-equal-to-k/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3835-count-subarrays-with-cost-less-than-or-equal-to-k/</guid><description>Medium | Array, Queue, Monotonic Queue</description></item><item><title>3845. 有界范围内的最大子数组异或值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3845-maximum-subarray-xor-with-bounded-range/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3845-maximum-subarray-xor-with-bounded-range/</guid><description>Hard | Array, Bit Manipulation, Trie, Queue, Sliding Window, Prefix Sum, Monotonic Queue</description></item><item><title>2762. 连续子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2762-continuous-subarrays/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2762-continuous-subarrays/</guid><description>Medium | Array, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queue</description></item><item><title>2944. 购买水果需要的最少硬币数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2944-minimum-number-of-coins-for-fruits/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2944-minimum-number-of-coins-for-fruits/</guid><description>Medium | Array, Dynamic Programming, Queue, Heap (Priority Queue), Monotonic Queue</description></item><item><title>2945. 寻找最大非递减数组长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2945-find-maximum-non-decreasing-array-length/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2945-find-maximum-non-decreasing-array-length/</guid><description>Hard | Array, Binary Search, Dynamic Programming, Stack, Queue, Monotonic Stack, Prefix Sum, Monotonic Queue</description></item><item><title>2071. 能完成的最大任务数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2071-maximum-number-of-tasks-you-can-assign/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2071-maximum-number-of-tasks-you-can-assign/</guid><description>Hard | Array, Two Pointers, Binary Search, Greedy, Queue, Sorting, Monotonic Queue</description></item><item><title>2407. 最长递增子序列 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2407-longest-increasing-subsequence-ii/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2407-longest-increasing-subsequence-ii/</guid><description>Hard | Array, Divide and Conquer, Dynamic Programming, Binary Indexed Tree, Segment Tree, Queue, Monotonic Queue</description></item><item><title>2444. 固定边界的子数组数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2444-count-subarrays-with-fixed-bounds/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2444-count-subarrays-with-fixed-bounds/</guid><description>Hard | Array, Queue, Sliding Window, Monotonic Queue</description></item><item><title>1425. 约束子序列和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1425-constrained-subsequence-sum/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1425-constrained-subsequence-sum/</guid><description>Hard | Array, Dynamic Programming, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue</description></item><item><title>1499. 等式的最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1499-max-value-of-equation/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1499-max-value-of-equation/</guid><description>Hard | Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue</description></item><item><title>1696. 跳跃游戏 VI</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1696-jump-game-vi/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1696-jump-game-vi/</guid><description>Medium | Array, Dynamic Programming, Queue, Heap (Priority Queue), Monotonic Queue</description></item><item><title>862. 和至少为 K 的最短子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0862-shortest-subarray-with-sum-at-least-k/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0862-shortest-subarray-with-sum-at-least-k/</guid><description>Hard | Array, Binary Search, Queue, Sliding Window, Heap (Priority Queue), Prefix Sum, Monotonic Queue</description></item><item><title>918. 环形子数组的最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0918-maximum-sum-circular-subarray/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0918-maximum-sum-circular-subarray/</guid><description>Medium | Array, Divide and Conquer, Dynamic Programming, Queue, Monotonic Queue</description></item><item><title>239. 滑动窗口最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0239-sliding-window-maximum/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0239-sliding-window-maximum/</guid><description>Hard | Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue</description></item></channel></rss>