<?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 Stack on LeetCode 题解笔记</title><link>https://leetcode-solutions-5zk.pages.dev/tags/monotonic-stack/</link><description>Recent content in Monotonic Stack 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-stack/index.xml" rel="self" type="application/rss+xml"/><item><title>1776. 车队 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1776-car-fleet-ii/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1776-car-fleet-ii/</guid><description>Hard | Array, Math, Stack, Heap (Priority Queue), Monotonic Stack</description></item><item><title>1504. 统计全为1的子矩形</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1504-count-submatrices-with-all-ones/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1504-count-submatrices-with-all-ones/</guid><description>Medium | Array, Dynamic Programming, Stack, Matrix, Monotonic Stack</description></item><item><title>3229. 使数组等于目标数组所需的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3229-minimum-operations-to-make-array-equal-to-target/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3229-minimum-operations-to-make-array-equal-to-target/</guid><description>Hard | Array, Dynamic Programming, Stack, Greedy, Monotonic Stack</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>3430. 最多 K 个元素的子数组的最大值和最小值之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3430-maximum-and-minimum-sums-of-at-most-size-k-subarrays/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3430-maximum-and-minimum-sums-of-at-most-size-k-subarrays/</guid><description>Hard | Array, Math, Stack, Monotonic Stack</description></item><item><title>3523. 使数组非递减</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3523-make-array-non-decreasing/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3523-make-array-non-decreasing/</guid><description>Medium | Array, Stack, Greedy, Monotonic Stack</description></item><item><title>3542. 将所有元素转换为零的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3542-minimum-operations-to-convert-all-elements-to-zero/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3542-minimum-operations-to-convert-all-elements-to-zero/</guid><description>Medium | Array, Hash Table, Stack, Greedy, Monotonic Stack</description></item><item><title>3638. 最大平衡货运数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3638-maximum-balanced-shipments/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3638-maximum-balanced-shipments/</guid><description>Medium | Array, Dynamic Programming, Stack, Greedy, Monotonic Stack</description></item><item><title>3676. 碗形子数组计数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3676-count-bowl-subarrays/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3676-count-bowl-subarrays/</guid><description>Medium | Array, Stack, Monotonic Stack</description></item><item><title>3816. 删除重复字符后的字典序最小字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3816-lexicographically-smallest-string-after-deleting-duplicate-characters/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3816-lexicographically-smallest-string-after-deleting-duplicate-characters/</guid><description>Hard | Hash Table, String, Stack, Greedy, Monotonic Stack</description></item><item><title>3878. 统计好子数组的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3878-count-good-subarrays/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3878-count-good-subarrays/</guid><description>Hard | Array, Stack, Bit Manipulation, Monotonic Stack</description></item><item><title>3113. 找到边界元素是最大值的子数组数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3113-find-the-number-of-subarrays-where-boundary-elements-are-maximum/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3113-find-the-number-of-subarrays-where-boundary-elements-are-maximum/</guid><description>Hard | Array, Binary Search, Stack, Monotonic Stack</description></item><item><title>2736. 最大和查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2736-maximum-sum-queries/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2736-maximum-sum-queries/</guid><description>Hard | Array, Binary Search, Stack, Binary Indexed Tree, Segment Tree, Sorting, Monotonic Stack</description></item><item><title>2818. 应用操作最大化分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2818-apply-operations-to-maximize-score/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2818-apply-operations-to-maximize-score/</guid><description>Hard | Array, Math, Stack, Greedy, Sorting, Monotonic Stack, Number Theory</description></item><item><title>2865. 美丽塔 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2865-beautiful-towers-i/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2865-beautiful-towers-i/</guid><description>Medium | Array, Stack, Monotonic Stack</description></item><item><title>2866. 美丽塔 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2866-beautiful-towers-ii/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2866-beautiful-towers-ii/</guid><description>Medium | Array, Stack, Monotonic Stack</description></item><item><title>2940. 找到爱丽丝和鲍勃可以相遇的建筑</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2940-find-building-where-alice-and-bob-can-meet/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2940-find-building-where-alice-and-bob-can-meet/</guid><description>Hard | Array, Binary Search, Stack, Binary Indexed Tree, Segment Tree, Heap (Priority Queue), Monotonic Stack</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>2030. 长度为 K 且字母出现次数最少的最小字典序子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2030-smallest-k-length-subsequence-with-occurrences-of-a-letter/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2030-smallest-k-length-subsequence-with-occurrences-of-a-letter/</guid><description>Hard | String, Stack, Greedy, Monotonic Stack</description></item><item><title>2104. 子数组范围之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2104-sum-of-subarray-ranges/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2104-sum-of-subarray-ranges/</guid><description>Medium | Array, Stack, Monotonic Stack</description></item><item><title>2281. 巫师的总力量之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2281-sum-of-total-strength-of-wizards/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2281-sum-of-total-strength-of-wizards/</guid><description>Hard | Array, Stack, Monotonic Stack, Prefix Sum</description></item><item><title>2289. 使数组非递减的步数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2289-steps-to-make-array-non-decreasing/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2289-steps-to-make-array-non-decreasing/</guid><description>Medium | Array, Linked List, Dynamic Programming, Stack, Monotonic Stack, Simulation</description></item><item><title>2334. 元素大于变化阈值的子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2334-subarray-with-elements-greater-than-varying-threshold/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2334-subarray-with-elements-greater-than-varying-threshold/</guid><description>Hard | Array, Stack, Union-Find, Monotonic Stack</description></item><item><title>2454. 第二个更大元素 IV</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2454-next-greater-element-iv/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2454-next-greater-element-iv/</guid><description>Hard | Array, Binary Search, Stack, Sorting, Heap (Priority Queue), Monotonic Stack</description></item><item><title>2487. 从链表中移除节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2487-remove-nodes-from-linked-list/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2487-remove-nodes-from-linked-list/</guid><description>Medium | Linked List, Stack, Recursion, Monotonic Stack</description></item><item><title>2617. 网格中到达目标的最少访问单元格数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2617-minimum-number-of-visited-cells-in-a-grid/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2617-minimum-number-of-visited-cells-in-a-grid/</guid><description>Hard | Array, Dynamic Programming, Stack, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix, Monotonic Stack</description></item><item><title>1475. 商店中每个商品的最终价格</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1475-final-prices-with-a-special-discount-in-a-shop/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1475-final-prices-with-a-special-discount-in-a-shop/</guid><description>Easy | Array, Stack, Monotonic Stack</description></item><item><title>1526. 形成目标数组的子数组最少增加次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array/</guid><description>Hard | Array, Dynamic Programming, Stack, Greedy, Monotonic Stack</description></item><item><title>1574. 删除最短子数组使剩余数组有序</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1574-shortest-subarray-to-be-removed-to-make-array-sorted/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1574-shortest-subarray-to-be-removed-to-make-array-sorted/</guid><description>Medium | Array, Two Pointers, Binary Search, Stack, Monotonic Stack</description></item><item><title>1673. 找到最具竞争力的子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1673-find-the-most-competitive-subsequence/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1673-find-the-most-competitive-subsequence/</guid><description>Medium | Array, Stack, Greedy, Monotonic Stack</description></item><item><title>1793. 好子数组的最大分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1793-maximum-score-of-a-good-subarray/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1793-maximum-score-of-a-good-subarray/</guid><description>Hard | Array, Two Pointers, Binary Search, Stack, Monotonic Stack</description></item><item><title>1856. 子数组最小乘积的最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1856-maximum-subarray-min-product/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1856-maximum-subarray-min-product/</guid><description>Medium | Array, Stack, Monotonic Stack, Prefix Sum</description></item><item><title>1944. 队列中看到的人数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1944-number-of-visible-people-in-a-queue/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1944-number-of-visible-people-in-a-queue/</guid><description>Hard | Array, Stack, Monotonic Stack</description></item><item><title>1996. 游戏中弱角色的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1996-the-number-of-weak-characters-in-the-game/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1996-the-number-of-weak-characters-in-the-game/</guid><description>Medium | Array, Stack, Greedy, Sorting, Monotonic Stack</description></item><item><title>1008. 先序遍历构造二叉搜索树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1008-construct-binary-search-tree-from-preorder-traversal/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1008-construct-binary-search-tree-from-preorder-traversal/</guid><description>Medium | Array, Stack, Tree, Binary Search Tree, Monotonic Stack, Binary Tree</description></item><item><title>1019. 链表中的下一个更大节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1019-next-greater-node-in-linked-list/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1019-next-greater-node-in-linked-list/</guid><description>Medium | Array, Linked List, Stack, Monotonic Stack</description></item><item><title>1081. 不同字符的最小子序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1081-smallest-subsequence-of-distinct-characters/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1081-smallest-subsequence-of-distinct-characters/</guid><description>Medium | String, Stack, Greedy, Monotonic Stack</description></item><item><title>1124. 表现良好的最长时间段</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1124-longest-well-performing-interval/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1124-longest-well-performing-interval/</guid><description>Medium | Array, Hash Table, Stack, Monotonic Stack, Prefix Sum</description></item><item><title>1130. 叶值的最小代价生成树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1130-minimum-cost-tree-from-leaf-values/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1130-minimum-cost-tree-from-leaf-values/</guid><description>Medium | Array, Dynamic Programming, Stack, Greedy, Monotonic Stack</description></item><item><title>739. 每日温度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0739-daily-temperatures/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0739-daily-temperatures/</guid><description>Medium | Array, Stack, Monotonic Stack</description></item><item><title>768. 最多能完成排序的块 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0768-max-chunks-to-make-sorted-ii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0768-max-chunks-to-make-sorted-ii/</guid><description>Hard | Array, Stack, Greedy, Sorting, Monotonic Stack</description></item><item><title>769. 最大数量的数据块来排序数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0769-max-chunks-to-make-sorted/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0769-max-chunks-to-make-sorted/</guid><description>Medium | Array, Stack, Greedy, Sorting, Monotonic Stack</description></item><item><title>853. 车队</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0853-car-fleet/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0853-car-fleet/</guid><description>Medium | Array, Stack, Sorting, Monotonic Stack</description></item><item><title>901. 股票价格跨度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0901-online-stock-span/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0901-online-stock-span/</guid><description>Medium | Stack, Design, Monotonic Stack, Data Stream</description></item><item><title>907. 子数组最小值之和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0907-sum-of-subarray-minimums/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0907-sum-of-subarray-minimums/</guid><description>Medium | Array, Dynamic Programming, Stack, Monotonic Stack</description></item><item><title>962. 最大宽度坡</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0962-maximum-width-ramp/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0962-maximum-width-ramp/</guid><description>Medium | Array, Two Pointers, Stack, Monotonic Stack</description></item><item><title>975. 奇偶跳</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0975-odd-even-jump/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0975-odd-even-jump/</guid><description>Hard | Array, Dynamic Programming, Stack, Sorting, Monotonic Stack, Ordered Set</description></item><item><title>496. 下一个更大元素 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0496-next-greater-element-i/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0496-next-greater-element-i/</guid><description>Easy | Array, Hash Table, Stack, Monotonic Stack</description></item><item><title>503. 下一个更大元素 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0503-next-greater-element-ii/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0503-next-greater-element-ii/</guid><description>Medium | Array, Stack, Monotonic Stack</description></item><item><title>581. 最短无序连续子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0581-shortest-unsorted-continuous-subarray/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0581-shortest-unsorted-continuous-subarray/</guid><description>Medium | Array, Two Pointers, Stack, Greedy, Sorting, Monotonic Stack</description></item><item><title>654. 最大二叉树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0654-maximum-binary-tree/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0654-maximum-binary-tree/</guid><description>Medium | Array, Divide and Conquer, Stack, Tree, Monotonic Stack, Binary Tree</description></item><item><title>321. 创建最大数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0321-create-maximum-number/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0321-create-maximum-number/</guid><description>Hard | Array, Two Pointers, Stack, Greedy, Monotonic Stack</description></item><item><title>402. 移除K位数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0402-remove-k-digits/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0402-remove-k-digits/</guid><description>Medium | String, Stack, Greedy, Monotonic Stack</description></item><item><title>456. 132 模式</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0456-132-pattern/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0456-132-pattern/</guid><description>Medium | Array, Binary Search, Stack, Monotonic Stack, Ordered Set</description></item><item><title>316. 去除重复字母</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0316-remove-duplicate-letters/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0316-remove-duplicate-letters/</guid><description>Medium | String, Stack, Greedy, Monotonic Stack</description></item><item><title>42. 接雨水</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0042-trapping-rain-water/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0042-trapping-rain-water/</guid><description>Hard | Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack</description></item><item><title>84. 柱状图中最大的矩形</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0084-largest-rectangle-in-histogram/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0084-largest-rectangle-in-histogram/</guid><description>Hard | Array, Stack, Monotonic Stack</description></item><item><title>85. 最大矩形</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0085-maximal-rectangle/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0085-maximal-rectangle/</guid><description>Hard | Array, Dynamic Programming, Stack, Matrix, Monotonic Stack</description></item></channel></rss>