<?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>Stack on LeetCode 题解笔记</title><link>https://leetcode-solutions-5zk.pages.dev/tags/stack/</link><description>Recent content in 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/stack/index.xml" rel="self" type="application/rss+xml"/><item><title>1896. 改变表达式最终值的最小开销</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1896-minimum-cost-to-change-the-final-value-of-expression/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1896-minimum-cost-to-change-the-final-value-of-expression/</guid><description>Hard | Math, String, Dynamic Programming, Stack</description></item><item><title>770. 基础计算器 IV</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0770-basic-calculator-iv/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0770-basic-calculator-iv/</guid><description>Hard | Hash Table, Math, String, Stack, Recursion</description></item><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>2019. 学生们解数学表达式的分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2019-the-score-of-students-solving-math-expression/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2019-the-score-of-students-solving-math-expression/</guid><description>Hard | Array, Hash Table, Math, String, Dynamic Programming, Stack, Memoization</description></item><item><title>1003. 检查字符串是否有效</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1003-check-if-word-is-valid-after-substitutions/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1003-check-if-word-is-valid-after-substitutions/</guid><description>Medium | String, 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>20. 有效的括号</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0020-valid-parentheses/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0020-valid-parentheses/</guid><description>Easy | String, Stack</description></item><item><title>488. 祖玛游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0488-zuma-game/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0488-zuma-game/</guid><description>Hard | String, Dynamic Programming, Stack, Breadth-First Search, Memoization</description></item><item><title>735. 小行星碰撞</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0735-asteroid-collision/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0735-asteroid-collision/</guid><description>Medium | Array, Stack, Simulation</description></item><item><title>736. 解析 Lisp 表达式</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0736-parse-lisp-expression/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0736-parse-lisp-expression/</guid><description>Hard | Hash Table, String, Stack, Recursion</description></item><item><title>844. 比较含退格的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0844-backspace-string-compare/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0844-backspace-string-compare/</guid><description>Easy | Two Pointers, String, Stack, Simulation</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>3412. 字符串的镜像分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3412-find-mirror-score-of-a-string/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3412-find-mirror-score-of-a-string/</guid><description>Medium | Hash Table, String, Stack, Simulation</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>3561. 相邻删除后的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3561-resulting-string-after-adjacent-removals/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3561-resulting-string-after-adjacent-removals/</guid><description>Medium | String, Stack, Simulation</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>3703. 移除K平衡子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3703-remove-k-balanced-substrings/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3703-remove-k-balanced-substrings/</guid><description>Medium | String, Stack, Simulation</description></item><item><title>3746. 均衡移除后的最小字符串长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3746-minimum-string-length-after-balanced-removals/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3746-minimum-string-length-after-balanced-removals/</guid><description>Medium | String, Stack, Counting</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>3834. 合并相邻相等元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3834-merge-adjacent-equal-elements/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3834-merge-adjacent-equal-elements/</guid><description>Medium | Array, Stack, Simulation</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>3170. 移除星号后字典序最小的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3170-lexicographically-minimum-string-after-removing-stars/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3170-lexicographically-minimum-string-after-removing-stars/</guid><description>Medium | Hash Table, String, Stack, Greedy, Heap (Priority Queue)</description></item><item><title>3174. 清除数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3174-clear-digits/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3174-clear-digits/</guid><description>Easy | String, Stack, Simulation</description></item><item><title>2645. 构造有效字符串的最少插入次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2645-minimum-additions-to-make-valid-string/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2645-minimum-additions-to-make-valid-string/</guid><description>Medium | String, Dynamic Programming, Stack, Greedy</description></item><item><title>2696. 移除子串后的最小字符串长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2696-minimum-string-length-after-removing-substrings/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2696-minimum-string-length-after-removing-substrings/</guid><description>Easy | String, Stack, Simulation</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>2751. 机器人碰撞</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2751-robot-collisions/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2751-robot-collisions/</guid><description>Hard | Array, Stack, Sorting, Simulation</description></item><item><title>2813. 最大 K 长度子序列的优雅度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2813-maximum-elegance-of-a-k-length-subsequence/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2813-maximum-elegance-of-a-k-length-subsequence/</guid><description>Hard | Array, Hash Table, Stack, Greedy, Sorting, Heap (Priority Queue)</description></item><item><title>2816. 将链表表示的数字翻倍</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2816-double-a-number-represented-as-a-linked-list/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2816-double-a-number-represented-as-a-linked-list/</guid><description>Medium | Linked List, Math, 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>2116. 检查括号字符串是否可以有效</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2116-check-if-a-parentheses-string-can-be-valid/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2116-check-if-a-parentheses-string-can-be-valid/</guid><description>Medium | String, Stack, Greedy</description></item><item><title>2130. 链表的最大孪生和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2130-maximum-twin-sum-of-a-linked-list/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2130-maximum-twin-sum-of-a-linked-list/</guid><description>Medium | Linked List, Two Pointers, Stack</description></item><item><title>2197. 替换数组中的非互质数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2197-replace-non-coprime-numbers-in-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2197-replace-non-coprime-numbers-in-array/</guid><description>Hard | Array, Math, Stack, Number Theory</description></item><item><title>2211. 道路上的碰撞次数统计</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2211-count-collisions-on-a-road/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2211-count-collisions-on-a-road/</guid><description>Medium | String, Stack, Simulation</description></item><item><title>2216. 使数组变美丽的最少删除次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2216-minimum-deletions-to-make-array-beautiful/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2216-minimum-deletions-to-make-array-beautiful/</guid><description>Medium | Array, Stack, Greedy</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>2296. 设计文本编辑器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2296-design-a-text-editor/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2296-design-a-text-editor/</guid><description>Hard | Linked List, String, Stack, Design, Simulation, Doubly-Linked List</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>2375. 根据DI字符串构造最小数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2375-construct-smallest-number-from-di-string/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2375-construct-smallest-number-from-di-string/</guid><description>Medium | String, Backtracking, Stack, Greedy</description></item><item><title>2390. 移除字符串中的星号</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2390-removing-stars-from-a-string/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2390-removing-stars-from-a-string/</guid><description>Medium | String, Stack, Simulation</description></item><item><title>2434. 使用机器人打印字典序最小的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2434-using-a-robot-to-print-the-lexicographically-smallest-string/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2434-using-a-robot-to-print-the-lexicographically-smallest-string/</guid><description>Medium | Hash Table, String, Stack, Greedy</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>2589. 完成所有任务的最少时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2589-minimum-time-to-complete-all-tasks/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2589-minimum-time-to-complete-all-tasks/</guid><description>Hard | Array, Binary Search, Stack, Greedy, Sorting</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>1381. 设计一个支持增量操作的栈</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1381-design-a-stack-with-increment-operation/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1381-design-a-stack-with-increment-operation/</guid><description>Medium | Array, Stack, Design</description></item><item><title>1441. 用栈操作构建数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1441-build-an-array-with-stack-operations/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1441-build-an-array-with-stack-operations/</guid><description>Medium | Array, Stack, Simulation</description></item><item><title>1472. 设计浏览器历史记录</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1472-design-browser-history/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1472-design-browser-history/</guid><description>Medium | Array, Linked List, Stack, Design, Doubly-Linked List, Data Stream</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>1541. 平衡括号字符串的最少插入次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1541-minimum-insertions-to-balance-a-parentheses-string/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1541-minimum-insertions-to-balance-a-parentheses-string/</guid><description>Medium | String, Stack, Greedy</description></item><item><title>1544. 整理字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1544-make-the-string-great/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1544-make-the-string-great/</guid><description>Easy | String, 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>1598. 爬虫日志文件夹</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1598-crawler-log-folder/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1598-crawler-log-folder/</guid><description>Easy | Array, String, Stack</description></item><item><title>1614. 括号的最大嵌套深度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1614-maximum-nesting-depth-of-the-parentheses/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1614-maximum-nesting-depth-of-the-parentheses/</guid><description>Easy | String, Stack</description></item><item><title>1653. 使字符串平衡的最少删除次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1653-minimum-deletions-to-make-string-balanced/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1653-minimum-deletions-to-make-string-balanced/</guid><description>Medium | String, Dynamic Programming, 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>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>1717. 移除子字符串的最大得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1717-maximum-score-from-removing-substrings/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1717-maximum-score-from-removing-substrings/</guid><description>Medium | String, Stack, Greedy</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>1910. 删除字符串中的所有指定子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1910-remove-all-occurrences-of-a-substring/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1910-remove-all-occurrences-of-a-substring/</guid><description>Medium | String, Stack, Simulation</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>1963. 使字符串平衡的最少交换次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1963-minimum-number-of-swaps-to-make-the-string-balanced/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1963-minimum-number-of-swaps-to-make-the-string-balanced/</guid><description>Medium | Two Pointers, String, Stack, Greedy</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>2000. 反转字符串中的前缀</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2000-reverse-prefix-of-word/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2000-reverse-prefix-of-word/</guid><description>Easy | Two Pointers, String, Stack</description></item><item><title>1006. 笨阶乘</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1006-clumsy-factorial/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1006-clumsy-factorial/</guid><description>Medium | Math, Stack, Simulation</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>1021. 移除最外层的括号</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1021-remove-outermost-parentheses/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1021-remove-outermost-parentheses/</guid><description>Easy | String, Stack</description></item><item><title>1047. 删除字符串中的所有相邻重复项</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1047-remove-all-adjacent-duplicates-in-string/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1047-remove-all-adjacent-duplicates-in-string/</guid><description>Easy | String, 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>1096. 花括号展开 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1096-brace-expansion-ii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1096-brace-expansion-ii/</guid><description>Hard | Hash Table, String, Backtracking, Stack, Breadth-First Search, Sorting</description></item><item><title>1106. 解析布尔表达式</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1106-parsing-a-boolean-expression/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1106-parsing-a-boolean-expression/</guid><description>Hard | String, Stack, Recursion</description></item><item><title>1111. 两个有效括号字符串的最大嵌套深度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1111-maximum-nesting-depth-of-two-valid-parentheses-strings/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1111-maximum-nesting-depth-of-two-valid-parentheses-strings/</guid><description>Medium | String, 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>1172. 餐盘栈</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1172-dinner-plate-stacks/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1172-dinner-plate-stacks/</guid><description>Hard | Hash Table, Stack, Design, Heap (Priority Queue)</description></item><item><title>1190. 反转每对括号间的子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1190-reverse-substrings-between-each-pair-of-parentheses/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1190-reverse-substrings-between-each-pair-of-parentheses/</guid><description>Medium | String, Stack</description></item><item><title>1209. 删除字符串中的所有相邻重复项 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1209-remove-all-adjacent-duplicates-in-string-ii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1209-remove-all-adjacent-duplicates-in-string-ii/</guid><description>Medium | String, Stack</description></item><item><title>1249. 使括号有效的最少删除</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1249-minimum-remove-to-make-valid-parentheses/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1249-minimum-remove-to-make-valid-parentheses/</guid><description>Medium | String, Stack</description></item><item><title>726. 原子的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0726-number-of-atoms/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0726-number-of-atoms/</guid><description>Hard | Hash Table, String, Stack, Sorting</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>856. 括号的分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0856-score-of-parentheses/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0856-score-of-parentheses/</guid><description>Medium | String, Stack</description></item><item><title>880. 索引处的解码字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0880-decoded-string-at-index/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0880-decoded-string-at-index/</guid><description>Medium | String, Stack</description></item><item><title>895. 最大频率栈</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0895-maximum-frequency-stack/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0895-maximum-frequency-stack/</guid><description>Hard | Hash Table, Stack, Design, Ordered Set</description></item><item><title>897. 递增顺序查找树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0897-increasing-order-search-tree/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0897-increasing-order-search-tree/</guid><description>Easy | Stack, Tree, Depth-First Search, Binary Search Tree, Binary Tree</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>921. 使括号有效的最少添加</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0921-minimum-add-to-make-parentheses-valid/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0921-minimum-add-to-make-parentheses-valid/</guid><description>Medium | String, Stack, Greedy</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>946. 验证栈序列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0946-validate-stack-sequences/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0946-validate-stack-sequences/</guid><description>Medium | Array, Stack, Simulation</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>589. N 叉树的前序遍历</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0589-n-ary-tree-preorder-traversal/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0589-n-ary-tree-preorder-traversal/</guid><description>Easy | Stack, Tree, Depth-First Search</description></item><item><title>590. N 叉树的后序遍历</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0590-n-ary-tree-postorder-traversal/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0590-n-ary-tree-postorder-traversal/</guid><description>Easy | Stack, Tree, Depth-First Search</description></item><item><title>591. 标签验证器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0591-tag-validator/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0591-tag-validator/</guid><description>Hard | String, Stack</description></item><item><title>636. 函数的独占时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0636-exclusive-time-of-functions/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0636-exclusive-time-of-functions/</guid><description>Medium | Array, 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>678. 有效的括号字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0678-valid-parenthesis-string/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0678-valid-parenthesis-string/</guid><description>Medium | String, Dynamic Programming, Stack, Greedy</description></item><item><title>682. 棒球比赛</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0682-baseball-game/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0682-baseball-game/</guid><description>Easy | Array, Stack, Simulation</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>331. 验证二叉树的前序序列化</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0331-verify-preorder-serialization-of-a-binary-tree/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0331-verify-preorder-serialization-of-a-binary-tree/</guid><description>Medium | String, Stack, Tree, Binary Tree</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>385. 迷你解析器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0385-mini-parser/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0385-mini-parser/</guid><description>Medium | String, Stack, Depth-First Search</description></item><item><title>388. 最长绝对文件路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0388-longest-absolute-file-path/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0388-longest-absolute-file-path/</guid><description>Medium | String, Stack, Depth-First Search</description></item><item><title>394. 字符串解码</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0394-decode-string/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0394-decode-string/</guid><description>Medium | String, Stack, Recursion</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>445. 两数相加 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0445-add-two-numbers-ii/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0445-add-two-numbers-ii/</guid><description>Medium | Linked List, Math, 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>114. 二叉树展开为链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0114-flatten-binary-tree-to-linked-list/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0114-flatten-binary-tree-to-linked-list/</guid><description>Medium | Linked List, Stack, Tree, Depth-First Search, Binary Tree</description></item><item><title>143. 重排链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0143-reorder-list/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0143-reorder-list/</guid><description>Medium | Linked List, Two Pointers, Stack, Recursion</description></item><item><title>144. 二叉树的前序遍历</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0144-binary-tree-preorder-traversal/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0144-binary-tree-preorder-traversal/</guid><description>Easy | Stack, Tree, Depth-First Search, Binary Tree</description></item><item><title>145. 二叉树的后序遍历</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0145-binary-tree-postorder-traversal/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0145-binary-tree-postorder-traversal/</guid><description>Easy | Stack, Tree, Depth-First Search, Binary Tree</description></item><item><title>150. 逆波兰表达式求值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0150-evaluate-reverse-polish-notation/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0150-evaluate-reverse-polish-notation/</guid><description>Medium | Array, Math, Stack</description></item><item><title>155. 最小栈</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0155-min-stack/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0155-min-stack/</guid><description>Medium | Stack, Design</description></item><item><title>173. 二叉搜索树迭代器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0173-binary-search-tree-iterator/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0173-binary-search-tree-iterator/</guid><description>Medium | Stack, Tree, Design, Binary Search Tree, Binary Tree, Iterator</description></item><item><title>224. 基本计算器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0224-basic-calculator/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0224-basic-calculator/</guid><description>Hard | Math, String, Stack, Recursion</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>227. 基本计算器 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0227-basic-calculator-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0227-basic-calculator-ii/</guid><description>Medium | Math, String, Stack</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>234. 回文链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0234-palindrome-linked-list/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0234-palindrome-linked-list/</guid><description>Easy | Linked List, Two Pointers, Stack, Recursion</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>32. 最长有效括号</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0032-longest-valid-parentheses/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0032-longest-valid-parentheses/</guid><description>Hard | String, Dynamic Programming, 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>71. 简化路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0071-simplify-path/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0071-simplify-path/</guid><description>Medium | String, 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><item><title>94. 二叉树的中序遍历</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0094-binary-tree-inorder-traversal/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0094-binary-tree-inorder-traversal/</guid><description>Easy | Stack, Tree, Depth-First Search, Binary Tree</description></item></channel></rss>