<?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>Queue on LeetCode 题解笔记</title><link>https://leetcode-solutions-5zk.pages.dev/tags/queue/</link><description>Recent content in 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/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>3508. 实现路由器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3508-implement-router/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3508-implement-router/</guid><description>Medium | Array, Hash Table, Binary Search, Design, Queue, Ordered Set</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>3829. 设计拼车系统</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3829-design-ride-sharing-system/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3829-design-ride-sharing-system/</guid><description>Medium | Hash Table, Design, Queue, Data Stream</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>3117. 通过划分数组的最小值和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3117-minimum-sum-of-values-by-dividing-array/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3117-minimum-sum-of-values-by-dividing-array/</guid><description>Hard | Array, Binary Search, Dynamic Programming, Bit Manipulation, Segment Tree, Queue</description></item><item><title>3191. 使二进制数组元素等于 1 的最小操作数 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3191-minimum-operations-to-make-binary-array-elements-equal-to-one-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3191-minimum-operations-to-make-binary-array-elements-equal-to-one-i/</guid><description>Medium | Array, Bit Manipulation, Queue, Sliding Window, Prefix Sum</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>2073. 买票需要的时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2073-time-needed-to-buy-tickets/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2073-time-needed-to-buy-tickets/</guid><description>Easy | Array, Queue, Simulation</description></item><item><title>2327. 知道秘密的人数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2327-number-of-people-aware-of-a-secret/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2327-number-of-people-aware-of-a-secret/</guid><description>Medium | Dynamic Programming, Queue, Simulation</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>2526. 从数据流中查找连续整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2526-find-consecutive-integers-from-a-data-stream/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2526-find-consecutive-integers-from-a-data-stream/</guid><description>Medium | Hash Table, Design, Queue, Counting, Data Stream</description></item><item><title>2528. 最大化城市的最小电力</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2528-maximize-the-minimum-powered-city/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2528-maximize-the-minimum-powered-city/</guid><description>Hard | Array, Binary Search, Greedy, Queue, Sliding Window, Prefix Sum</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>1670. 设计前中后队列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1670-design-front-middle-back-queue/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1670-design-front-middle-back-queue/</guid><description>Medium | Array, Linked List, Design, Queue, Doubly-Linked List, Data Stream</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>1700. 无法吃午餐的学生数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1700-number-of-students-unable-to-eat-lunch/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1700-number-of-students-unable-to-eat-lunch/</guid><description>Easy | Array, Stack, Queue, Simulation</description></item><item><title>1823. 找到圆形游戏的获胜者</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1823-find-the-winner-of-the-circular-game/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1823-find-the-winner-of-the-circular-game/</guid><description>Medium | Array, Math, Recursion, Queue, Simulation</description></item><item><title>1825. 找到 MK 平均值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1825-finding-mk-average/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1825-finding-mk-average/</guid><description>Hard | Design, Queue, Heap (Priority Queue), Data Stream, Ordered Set</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>933. 最近的请求次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0933-number-of-recent-calls/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0933-number-of-recent-calls/</guid><description>Easy | Design, Queue, Data Stream</description></item><item><title>936. 戳印序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0936-stamping-the-sequence/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0936-stamping-the-sequence/</guid><description>Hard | String, Stack, Greedy, Queue</description></item><item><title>950. 按递增顺序显示卡牌</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0950-reveal-cards-in-increasing-order/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0950-reveal-cards-in-increasing-order/</guid><description>Medium | Array, Queue, Sorting, Simulation</description></item><item><title>995. K 连续位的最小翻转次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0995-minimum-number-of-k-consecutive-bit-flips/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0995-minimum-number-of-k-consecutive-bit-flips/</guid><description>Hard | Array, Bit Manipulation, Queue, Sliding Window, Prefix Sum</description></item><item><title>622. 设计循环队列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0622-design-circular-queue/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0622-design-circular-queue/</guid><description>Medium | Array, Linked List, Design, Queue</description></item><item><title>641. 设计循环双端队列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0641-design-circular-deque/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0641-design-circular-deque/</guid><description>Medium | Array, Linked List, Design, Queue</description></item><item><title>649. Dota2 参议院</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0649-dota2-senate/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0649-dota2-senate/</guid><description>Medium | String, Greedy, Queue</description></item><item><title>341. 扁平化嵌套列表迭代器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0341-flatten-nested-list-iterator/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0341-flatten-nested-list-iterator/</guid><description>Medium | Stack, Tree, Depth-First Search, Design, Queue, Iterator</description></item><item><title>387. 字符串中的第一个唯一字符</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0387-first-unique-character-in-a-string/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0387-first-unique-character-in-a-string/</guid><description>Easy | Hash Table, String, Queue, Counting</description></item><item><title>225. 用队列实现栈</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0225-implement-stack-using-queues/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0225-implement-stack-using-queues/</guid><description>Easy | Stack, Design, Queue</description></item><item><title>232. 用栈实现队列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0232-implement-queue-using-stacks/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0232-implement-queue-using-stacks/</guid><description>Easy | Stack, Design, 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>