<?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>Matrix on LeetCode 题解笔记</title><link>https://leetcode-solutions-5zk.pages.dev/tags/matrix/</link><description>Recent content in Matrix 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/matrix/index.xml" rel="self" type="application/rss+xml"/><item><title>1263. 将箱子推到目标位置的最小推动次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1263-minimum-moves-to-move-a-box-to-their-target-location/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1263-minimum-moves-to-move-a-box-to-their-target-location/</guid><description>Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrix</description></item><item><title>1728. 猫和老鼠游戏 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1728-cat-and-mouse-ii/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1728-cat-and-mouse-ii/</guid><description>Hard | Array, Math, Dynamic Programming, Graph Theory, Topological Sort, Memoization, Matrix, Game Theory</description></item><item><title>3197. 覆盖所有一的最小矩形面积 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3197-find-the-minimum-area-to-cover-all-ones-ii/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3197-find-the-minimum-area-to-cover-all-ones-ii/</guid><description>Hard | Array, Matrix, Enumeration</description></item><item><title>3418. 机器人能获得的最大金钱数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3418-maximum-amount-of-money-robot-can-earn/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3418-maximum-amount-of-money-robot-can-earn/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>3548. 等和网格分割 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3548-equal-sum-grid-partition-ii/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3548-equal-sum-grid-partition-ii/</guid><description>Hard | Array, Hash Table, Matrix, Enumeration, Prefix Sum</description></item><item><title>1631. 最小体力消耗路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1631-path-with-minimum-effort/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1631-path-with-minimum-effort/</guid><description>Medium | Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix</description></item><item><title>1727. 重新排列后的最大子矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1727-largest-submatrix-with-rearrangements/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1727-largest-submatrix-with-rearrangements/</guid><description>Medium | Array, Greedy, Sorting, Matrix</description></item><item><title>1765. 最高峰地图</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1765-map-of-highest-peak/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1765-map-of-highest-peak/</guid><description>Medium | Array, Breadth-First Search, Matrix</description></item><item><title>1861. 旋转盒子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1861-rotating-the-box/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1861-rotating-the-box/</guid><description>Medium | Array, Two Pointers, Matrix</description></item><item><title>1926. 迷宫中离入口最近的出口</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1926-nearest-exit-from-entrance-in-maze/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1926-nearest-exit-from-entrance-in-maze/</guid><description>Medium | Array, Breadth-First Search, Matrix</description></item><item><title>1992. 查找农田的所有组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1992-find-all-groups-of-farmland/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1992-find-all-groups-of-farmland/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Matrix</description></item><item><title>2018. 检查单词是否可以放在纵横填字游戏中</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2018-check-if-word-can-be-placed-in-crossword/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2018-check-if-word-can-be-placed-in-crossword/</guid><description>Medium | Array, Matrix, Enumeration</description></item><item><title>2088. 统计农场中肥沃金字塔的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2088-count-fertile-pyramids-in-a-land/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2088-count-fertile-pyramids-in-a-land/</guid><description>Hard | Array, Dynamic Programming, Matrix</description></item><item><title>2125. 银行中的激光束数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2125-number-of-laser-beams-in-a-bank/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2125-number-of-laser-beams-in-a-bank/</guid><description>Medium | Array, Math, String, Matrix</description></item><item><title>2132. 邮票网格</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2132-stamping-the-grid/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2132-stamping-the-grid/</guid><description>Hard | Array, Greedy, Matrix, Prefix Sum</description></item><item><title>2146. 价格范围内 K 个最高排名的物品</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2146-k-highest-ranked-items-within-a-price-range/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2146-k-highest-ranked-items-within-a-price-range/</guid><description>Medium | Array, Breadth-First Search, Sorting, Heap (Priority Queue), Matrix</description></item><item><title>2257. 统计网格图中没有被保卫的格子数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2257-count-unguarded-cells-in-the-grid/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2257-count-unguarded-cells-in-the-grid/</guid><description>Medium | Array, Matrix, Simulation</description></item><item><title>2258. 逃离火灾扩散</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2258-escape-the-spreading-fire/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2258-escape-the-spreading-fire/</guid><description>Hard | Array, Binary Search, Breadth-First Search, Matrix</description></item><item><title>2319. 检查矩阵是否为 X 矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2319-check-if-matrix-is-x-matrix/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2319-check-if-matrix-is-x-matrix/</guid><description>Easy | Array, Matrix</description></item><item><title>2392. 构造满足条件的矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2392-build-a-matrix-with-conditions/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2392-build-a-matrix-with-conditions/</guid><description>Hard | Array, Graph Theory, Topological Sort, Matrix</description></item><item><title>2397. 列覆盖的最大行数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2397-maximum-rows-covered-by-columns/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2397-maximum-rows-covered-by-columns/</guid><description>Medium | Array, Backtracking, Bit Manipulation, Matrix, Enumeration</description></item><item><title>36. 有效的数独</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0036-valid-sudoku/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0036-valid-sudoku/</guid><description>Medium | Array, Hash Table, Matrix</description></item><item><title>37. 数独求解器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0037-sudoku-solver/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0037-sudoku-solver/</guid><description>Hard | Array, Hash Table, Backtracking, Matrix</description></item><item><title>1034. 边界着色</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1034-coloring-a-border/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1034-coloring-a-border/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Matrix</description></item><item><title>1139. 最大 1 边界正方形</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1139-largest-1-bordered-square/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1139-largest-1-bordered-square/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>1162. 地图中的最高点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1162-as-far-from-land-as-possible/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1162-as-far-from-land-as-possible/</guid><description>Medium | Array, Dynamic Programming, Breadth-First Search, Matrix</description></item><item><title>1267. 统计参与通信的服务器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1267-count-servers-that-communicate/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1267-count-servers-that-communicate/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix, Counting</description></item><item><title>1277. 统计全为 1 的正方形子矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1277-count-square-submatrices-with-all-ones/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1277-count-square-submatrices-with-all-ones/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>1301. 最大得分的路径数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1301-number-of-paths-with-max-score/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1301-number-of-paths-with-max-score/</guid><description>Hard | Array, Dynamic Programming, Matrix</description></item><item><title>1337. 矩阵中战斗力最弱的 K 行</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1337-the-k-weakest-rows-in-a-matrix/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1337-the-k-weakest-rows-in-a-matrix/</guid><description>Easy | Array, Binary Search, Sorting, Heap (Priority Queue), Matrix</description></item><item><title>1349. 参加考试的最大学生数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1349-maximum-students-taking-exam/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1349-maximum-students-taking-exam/</guid><description>Hard | Array, Dynamic Programming, Bit Manipulation, Matrix, Bitmask</description></item><item><title>1380. 矩阵中的幸运数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1380-lucky-numbers-in-a-matrix/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1380-lucky-numbers-in-a-matrix/</guid><description>Easy | Array, Matrix</description></item><item><title>1439. 找到有序矩阵中第k小的数组和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1439-find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1439-find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/</guid><description>Hard | Array, Binary Search, Heap (Priority Queue), Matrix</description></item><item><title>1444. 切披萨的方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1444-number-of-ways-of-cutting-a-pizza/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1444-number-of-ways-of-cutting-a-pizza/</guid><description>Hard | Array, Dynamic Programming, Memoization, Matrix, Prefix Sum</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>1536. 排列二进制网格的最少交换次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1536-minimum-swaps-to-arrange-a-binary-grid/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1536-minimum-swaps-to-arrange-a-binary-grid/</guid><description>Medium | Array, Greedy, Matrix</description></item><item><title>1559. 检测二维网格中的环</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1559-detect-cycles-in-2d-grid/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1559-detect-cycles-in-2d-grid/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix</description></item><item><title>1568. 使岛屿分离的最少天数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1568-minimum-number-of-days-to-disconnect-island/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1568-minimum-number-of-days-to-disconnect-island/</guid><description>Hard | Array, Depth-First Search, Breadth-First Search, Matrix, Strongly Connected Component</description></item><item><title>1582. 二进制矩阵中的特殊位置</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1582-special-positions-in-a-binary-matrix/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1582-special-positions-in-a-binary-matrix/</guid><description>Easy | Array, Matrix</description></item><item><title>1595. 连接两组点的最小成本</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1595-minimum-cost-to-connect-two-groups-of-points/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1595-minimum-cost-to-connect-two-groups-of-points/</guid><description>Hard | Array, Dynamic Programming, Bit Manipulation, Matrix, Bitmask</description></item><item><title>1914. 循环轮转矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1914-cyclically-rotating-a-grid/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1914-cyclically-rotating-a-grid/</guid><description>Medium | Array, Matrix, Simulation</description></item><item><title>221. 最大正方形</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0221-maximal-square/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0221-maximal-square/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>289. 生命游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0289-game-of-life/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0289-game-of-life/</guid><description>Medium | Array, Matrix, Simulation</description></item><item><title>363. 矩形区域不超过 K 的最大数值和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0363-max-sum-of-rectangle-no-larger-than-k/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0363-max-sum-of-rectangle-no-larger-than-k/</guid><description>Hard | Array, Binary Search, Matrix, Prefix Sum, Ordered Set</description></item><item><title>407. 接雨水 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0407-trapping-rain-water-ii/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0407-trapping-rain-water-ii/</guid><description>Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrix</description></item><item><title>419. 甲板上的战舰</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0419-battleships-in-a-board/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0419-battleships-in-a-board/</guid><description>Medium | Array, Depth-First Search, Matrix</description></item><item><title>427. 构造四叉树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0427-construct-quad-tree/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0427-construct-quad-tree/</guid><description>Medium | Array, Divide and Conquer, Tree, Matrix</description></item><item><title>463. 岛屿的周长</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0463-island-perimeter/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0463-island-perimeter/</guid><description>Easy | Array, Depth-First Search, Breadth-First Search, Matrix</description></item><item><title>542. 01 矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0542-01-matrix/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0542-01-matrix/</guid><description>Medium | Array, Dynamic Programming, Breadth-First Search, Matrix</description></item><item><title>695. 岛屿的最大面积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0695-max-area-of-island/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0695-max-area-of-island/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix</description></item><item><title>749. 围堵病毒</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0749-contain-virus/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0749-contain-virus/</guid><description>Hard | Array, Depth-First Search, Breadth-First Search, Matrix, Simulation</description></item><item><title>794. 有效的井字游戏状态</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0794-valid-tic-tac-toe-state/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0794-valid-tic-tac-toe-state/</guid><description>Medium | Array, Matrix</description></item><item><title>827. 最大人工岛</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0827-making-a-large-island/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0827-making-a-large-island/</guid><description>Hard | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix</description></item><item><title>832. 翻转图像</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0832-flipping-an-image/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0832-flipping-an-image/</guid><description>Easy | Array, Two Pointers, Bit Manipulation, Matrix, Simulation</description></item><item><title>835. 图像重叠</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0835-image-overlap/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0835-image-overlap/</guid><description>Medium | Array, Matrix</description></item><item><title>864. 获取所有钥匙的最短路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0864-shortest-path-to-get-all-keys/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0864-shortest-path-to-get-all-keys/</guid><description>Hard | Array, Bit Manipulation, Breadth-First Search, Matrix</description></item><item><title>934. 最短的桥</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0934-shortest-bridge/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0934-shortest-bridge/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Matrix</description></item><item><title>959. 由斜杠分割的区域</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0959-regions-cut-by-slashes/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0959-regions-cut-by-slashes/</guid><description>Medium | Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Matrix</description></item><item><title>980. 不同路径 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0980-unique-paths-iii/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0980-unique-paths-iii/</guid><description>Hard | Array, Backtracking, Bit Manipulation, Matrix</description></item><item><title>994. 腐烂的橘子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0994-rotting-oranges/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0994-rotting-oranges/</guid><description>Medium | Array, Breadth-First Search, Matrix</description></item><item><title>999. 车的可用捕获量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0999-available-captures-for-rook/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0999-available-captures-for-rook/</guid><description>Easy | Array, Matrix, Simulation</description></item><item><title>3212. 计算 X 和 Y 频率相等的子矩阵数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3212-count-submatrices-with-equal-frequency-of-x-and-y/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3212-count-submatrices-with-equal-frequency-of-x-and-y/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>3225. 网格操作的最大分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3225-maximum-score-from-grid-operations/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3225-maximum-score-from-grid-operations/</guid><description>Hard | Array, Dynamic Programming, Matrix, Prefix Sum</description></item><item><title>3239. 使二进制网格回文的最少翻转次数 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3239-minimum-number-of-flips-to-make-binary-grid-palindromic-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3239-minimum-number-of-flips-to-make-binary-grid-palindromic-i/</guid><description>Medium | Array, Two Pointers, Matrix</description></item><item><title>3240. 使二进制网格回文的最少翻转次数 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3240-minimum-number-of-flips-to-make-binary-grid-palindromic-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3240-minimum-number-of-flips-to-make-binary-grid-palindromic-ii/</guid><description>Medium | Array, Two Pointers, Matrix</description></item><item><title>3242. 设计邻居和服务</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3242-design-neighbor-sum-service/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3242-design-neighbor-sum-service/</guid><description>Easy | Array, Hash Table, Design, Matrix, Simulation</description></item><item><title>3256. 通过放置三个车获得的最大价值和 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3256-maximum-value-sum-by-placing-three-rooks-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3256-maximum-value-sum-by-placing-three-rooks-i/</guid><description>Hard | Array, Dynamic Programming, Matrix, Enumeration</description></item><item><title>3257. 通过放置三个车获得最大价值和 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3257-maximum-value-sum-by-placing-three-rooks-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3257-maximum-value-sum-by-placing-three-rooks-ii/</guid><description>Hard | Array, Dynamic Programming, Matrix, Enumeration</description></item><item><title>3276. 在网格中选择具有最大分数的单元格</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3276-select-cells-in-grid-with-maximum-score/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3276-select-cells-in-grid-with-maximum-score/</guid><description>Hard | Array, Dynamic Programming, Bit Manipulation, Matrix, Bitmask</description></item><item><title>3286. 在网格中寻找安全路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3286-find-a-safe-walk-through-a-grid/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3286-find-a-safe-walk-through-a-grid/</guid><description>Medium | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path</description></item><item><title>3311. 构造匹配图布局的 2D 网格</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3311-construct-2d-grid-matching-graph-layout/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3311-construct-2d-grid-matching-graph-layout/</guid><description>Hard | Array, Hash Table, Graph Theory, Matrix</description></item><item><title>3332. 游客能够获得的最大积分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3332-maximum-points-tourist-can-earn/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3332-maximum-points-tourist-can-earn/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>3341. 找到到达最后一个房间的最短时间 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3341-find-minimum-time-to-reach-last-room-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3341-find-minimum-time-to-reach-last-room-i/</guid><description>Medium | Array, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path</description></item><item><title>3342. 寻找到达最后一个房间的最小时间 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3342-find-minimum-time-to-reach-last-room-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3342-find-minimum-time-to-reach-last-room-ii/</guid><description>Medium | Array, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path</description></item><item><title>3363. 找出可以收集的最大水果数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3363-find-the-maximum-number-of-fruits-collected/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3363-find-the-maximum-number-of-fruits-collected/</guid><description>Hard | Array, Dynamic Programming, Matrix</description></item><item><title>3393. 具有给定异或值的路径数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3393-count-paths-with-the-given-xor-value/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3393-count-paths-with-the-given-xor-value/</guid><description>Medium | Array, Dynamic Programming, Bit Manipulation, Matrix</description></item><item><title>3402. 使列严格递增的最少操作次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3402-minimum-operations-to-make-columns-strictly-increasing/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3402-minimum-operations-to-make-columns-strictly-increasing/</guid><description>Easy | Array, Greedy, Matrix</description></item><item><title>3417. 跳跃的之字形网格遍历</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3417-zigzag-grid-traversal-with-skip/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3417-zigzag-grid-traversal-with-skip/</guid><description>Easy | Array, Matrix, Simulation</description></item><item><title>3446. 按对角线排序矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3446-sort-matrix-by-diagonals/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3446-sort-matrix-by-diagonals/</guid><description>Medium | Array, Sorting, Matrix</description></item><item><title>3459. 最长 V 形对角线段的长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3459-length-of-longest-v-shaped-diagonal-segment/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3459-length-of-longest-v-shaped-diagonal-segment/</guid><description>Hard | Array, Dynamic Programming, Memoization, Matrix</description></item><item><title>3462. 最多 K 个元素的最大和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3462-maximum-sum-with-at-most-k-elements/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3462-maximum-sum-with-at-most-k-elements/</guid><description>Medium | Array, Greedy, Sorting, Heap (Priority Queue), Matrix</description></item><item><title>3484. 设计电子表格</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3484-design-spreadsheet/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3484-design-spreadsheet/</guid><description>Medium | Array, Hash Table, String, Design, Matrix</description></item><item><title>3529. 统计水平和垂直子串重叠的单元格数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3529-count-cells-in-overlapping-horizontal-and-vertical-substrings/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3529-count-cells-in-overlapping-horizontal-and-vertical-substrings/</guid><description>Medium | Array, String, Rolling Hash, String Matching, Matrix, Hash Function</description></item><item><title>3537. 填充特殊网格</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3537-fill-a-special-grid/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3537-fill-a-special-grid/</guid><description>Medium | Array, Divide and Conquer, Matrix</description></item><item><title>3546. 相等和网格划分 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3546-equal-sum-grid-partition-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3546-equal-sum-grid-partition-i/</guid><description>Medium | Array, Matrix, Enumeration, Prefix Sum</description></item><item><title>3552. 网格传送遍历</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3552-grid-teleportation-traversal/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3552-grid-teleportation-traversal/</guid><description>Medium | Array, Hash Table, Breadth-First Search, Matrix</description></item><item><title>3567. 滑动子矩阵的最小绝对差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3567-minimum-absolute-difference-in-sliding-submatrix/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3567-minimum-absolute-difference-in-sliding-submatrix/</guid><description>Medium | Array, Sorting, Matrix</description></item><item><title>3568. 清理教室的最少移动次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3568-minimum-moves-to-clean-the-classroom/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3568-minimum-moves-to-clean-the-classroom/</guid><description>Medium | Array, Hash Table, Bit Manipulation, Breadth-First Search, Matrix</description></item><item><title>3603. 交替方向的最小成本路径 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3603-minimum-cost-path-with-alternating-directions-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3603-minimum-cost-path-with-alternating-directions-ii/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>3619. 统计总价值能被 K 整除的岛屿数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3619-count-islands-with-total-value-divisible-by-k/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3619-count-islands-with-total-value-divisible-by-k/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix</description></item><item><title>3643. 垂直翻转正方形子矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3643-flip-square-submatrix-vertically/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3643-flip-square-submatrix-vertically/</guid><description>Easy | Array, Two Pointers, Matrix</description></item><item><title>3651. 有传送功能的最小路径代价</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3651-minimum-cost-path-with-teleportations/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3651-minimum-cost-path-with-teleportations/</guid><description>Hard | Array, Dynamic Programming, Matrix</description></item><item><title>3665. 扭曲镜面路径计数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3665-twisted-mirror-path-count/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3665-twisted-mirror-path-count/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>3725. 从行中选择互质整数的方案数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3725-count-ways-to-choose-coprime-integers-from-rows/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3725-count-ways-to-choose-coprime-integers-from-rows/</guid><description>Hard | Array, Math, Dynamic Programming, Matrix, Combinatorics, Number Theory</description></item><item><title>3742. 网格中的最大路径分数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3742-maximum-path-score-in-a-grid/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3742-maximum-path-score-in-a-grid/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>3797. 计算攀爬矩形网格的路径数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3797-count-routes-to-climb-a-rectangular-grid/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3797-count-routes-to-climb-a-rectangular-grid/</guid><description>Hard | Array, Dynamic Programming, Matrix, Prefix Sum</description></item><item><title>3858. 网格中的最小按位或</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3858-minimum-bitwise-or-from-grid/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3858-minimum-bitwise-or-from-grid/</guid><description>Medium | Array, Greedy, Bit Manipulation, Matrix</description></item><item><title>3882. 网格中的最小异或路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3882-minimum-xor-path-in-a-grid/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3882-minimum-xor-path-in-a-grid/</guid><description>Medium | Array, Dynamic Programming, Bit Manipulation, Matrix</description></item><item><title>2965. 找出缺失和重复的数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2965-find-missing-and-repeated-values/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2965-find-missing-and-repeated-values/</guid><description>Easy | Array, Hash Table, Math, Matrix</description></item><item><title>3030. 找到区域平均值的网格</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3030-find-the-grid-of-region-average/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3030-find-the-grid-of-region-average/</guid><description>Medium | Array, Matrix</description></item><item><title>3033. 修改矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3033-modify-the-matrix/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3033-modify-the-matrix/</guid><description>Easy | Array, Matrix</description></item><item><title>3044. 最频繁的质数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3044-most-frequent-prime/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3044-most-frequent-prime/</guid><description>Medium | Array, Hash Table, Math, Matrix, Counting, Enumeration, Number Theory</description></item><item><title>3070. 统计包含左上角元素且和小于等于k的子矩阵数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3070-count-submatrices-with-top-left-element-and-sum-less-than-k/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3070-count-submatrices-with-top-left-element-and-sum-less-than-k/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>3071. 在网格上写字母Y的最小操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3071-minimum-operations-to-write-the-letter-y-on-a-grid/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3071-minimum-operations-to-write-the-letter-y-on-a-grid/</guid><description>Medium | Array, Hash Table, Matrix, Counting</description></item><item><title>3122. 满足条件的最小操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3122-minimum-number-of-operations-to-satisfy-conditions/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3122-minimum-number-of-operations-to-satisfy-conditions/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>3127. 构造相同颜色的正方形</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3127-make-a-square-with-the-same-color/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3127-make-a-square-with-the-same-color/</guid><description>Easy | Array, Matrix, Enumeration</description></item><item><title>3142. 检查网格中的条件</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3142-check-if-grid-satisfies-conditions/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3142-check-if-grid-satisfies-conditions/</guid><description>Easy | Array, Matrix</description></item><item><title>3148. 网格中的最大差值得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3148-maximum-difference-score-in-a-grid/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3148-maximum-difference-score-in-a-grid/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>3195. 寻找覆盖所有1的最小矩形面积 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3195-find-the-minimum-area-to-cover-all-ones-i/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3195-find-the-minimum-area-to-cover-all-ones-i/</guid><description>Medium | Array, Matrix</description></item><item><title>2643. 一的数量最多的行</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2643-row-with-maximum-ones/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2643-row-with-maximum-ones/</guid><description>Easy | Array, Matrix</description></item><item><title>2658. 网格中鱼的最大数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2658-maximum-number-of-fish-in-a-grid/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2658-maximum-number-of-fish-in-a-grid/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix</description></item><item><title>2661. 第一个完全被涂色的行或列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2661-first-completely-painted-row-or-column/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2661-first-completely-painted-row-or-column/</guid><description>Medium | Array, Hash Table, Matrix</description></item><item><title>2679. 矩阵中的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2679-sum-in-a-matrix/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2679-sum-in-a-matrix/</guid><description>Medium | Array, Sorting, Heap (Priority Queue), Matrix, Simulation</description></item><item><title>2684. 网格中的最大移动数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2684-maximum-number-of-moves-in-a-grid/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2684-maximum-number-of-moves-in-a-grid/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>2711. 对角线上不同值数量的差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2711-difference-of-number-of-distinct-values-on-diagonals/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2711-difference-of-number-of-distinct-values-on-diagonals/</guid><description>Medium | Array, Hash Table, Matrix</description></item><item><title>2713. 矩阵中严格递增路径的最大长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2713-maximum-strictly-increasing-cells-in-a-matrix/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2713-maximum-strictly-increasing-cells-in-a-matrix/</guid><description>Hard | Array, Hash Table, Binary Search, Dynamic Programming, Memoization, Sorting, Matrix, Ordered Set</description></item><item><title>2732. 找到矩阵的好子集</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2732-find-a-good-subset-of-the-matrix/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2732-find-a-good-subset-of-the-matrix/</guid><description>Hard | Array, Hash Table, Bit Manipulation, Matrix</description></item><item><title>2812. 在网格中找到最安全路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2812-find-the-safest-path-in-a-grid/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2812-find-the-safest-path-in-a-grid/</guid><description>Medium | Array, Binary Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix</description></item><item><title>2850. 将石头分散到网格中的最少移动次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2850-minimum-moves-to-spread-stones-over-grid/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2850-minimum-moves-to-spread-stones-over-grid/</guid><description>Medium | Array, Dynamic Programming, Backtracking, Bit Manipulation, Matrix, Bitmask</description></item><item><title>2906. 构造乘积矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2906-construct-product-matrix/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2906-construct-product-matrix/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>2923. 找冠军 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2923-find-champion-i/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2923-find-champion-i/</guid><description>Easy | Array, Matrix</description></item><item><title>2931. 购买物品后的最大开销</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2931-maximum-spending-after-buying-items/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2931-maximum-spending-after-buying-items/</guid><description>Hard | Array, Greedy, Sorting, Heap (Priority Queue), Matrix</description></item><item><title>2946. 循环移位后的矩阵相似性</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2946-matrix-similarity-after-cyclic-shifts/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2946-matrix-similarity-after-cyclic-shifts/</guid><description>Easy | Array, Math, Matrix, Simulation</description></item><item><title>2017. 网格游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2017-grid-game/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2017-grid-game/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>2022. 将一维数组转换为二维数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2022-convert-1d-array-into-2d-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2022-convert-1d-array-into-2d-array/</guid><description>Easy | Array, Matrix, Simulation</description></item><item><title>2033. 使网格化为等值网格的最小操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2033-minimum-operations-to-make-a-uni-value-grid/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2033-minimum-operations-to-make-a-uni-value-grid/</guid><description>Medium | Array, Math, Sorting, Matrix</description></item><item><title>2133. 检查每一行和每一列是否都包含全部整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2133-check-if-every-row-and-column-contains-all-numbers/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2133-check-if-every-row-and-column-contains-all-numbers/</guid><description>Easy | Array, Hash Table, Matrix</description></item><item><title>2245. 拐弯路径的最大尾随零数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2245-maximum-trailing-zeros-in-a-cornered-path/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2245-maximum-trailing-zeros-in-a-cornered-path/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>2267. 检查是否存在有效的括号字符串路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2267-check-if-there-is-a-valid-parentheses-string-path/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2267-check-if-there-is-a-valid-parentheses-string-path/</guid><description>Hard | Array, Dynamic Programming, Matrix</description></item><item><title>2290. 到达角落的最少障碍移除次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2290-minimum-obstacle-removal-to-reach-corner/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2290-minimum-obstacle-removal-to-reach-corner/</guid><description>Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path</description></item><item><title>2304. 网格中的最小路径代价</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2304-minimum-path-cost-in-a-grid/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2304-minimum-path-cost-in-a-grid/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>2326. 螺旋矩阵 IV</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2326-spiral-matrix-iv/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2326-spiral-matrix-iv/</guid><description>Medium | Array, Linked List, Matrix, Simulation</description></item><item><title>2328. 网格中递增路径的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2328-number-of-increasing-paths-in-a-grid/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2328-number-of-increasing-paths-in-a-grid/</guid><description>Hard | Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrix</description></item><item><title>2352. 相等行列对</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2352-equal-row-and-column-pairs/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2352-equal-row-and-column-pairs/</guid><description>Medium | Array, Hash Table, Matrix, Simulation</description></item><item><title>2373. 矩阵中的局部最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2373-largest-local-values-in-a-matrix/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2373-largest-local-values-in-a-matrix/</guid><description>Easy | Array, Matrix</description></item><item><title>2428. 沙漏的最大总和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2428-maximum-sum-of-an-hourglass/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2428-maximum-sum-of-an-hourglass/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>2435. 矩阵中和能被 K 整除的路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2435-paths-in-matrix-whose-sum-is-divisible-by-k/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2435-paths-in-matrix-whose-sum-is-divisible-by-k/</guid><description>Hard | Array, Dynamic Programming, Matrix</description></item><item><title>2482. 行列间一和零的差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2482-difference-between-ones-and-zeros-in-row-and-column/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2482-difference-between-ones-and-zeros-in-row-and-column/</guid><description>Medium | Array, Matrix, Simulation</description></item><item><title>2500. 删除每行中的最大值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2500-delete-greatest-value-in-each-row/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2500-delete-greatest-value-in-each-row/</guid><description>Easy | Array, Sorting, Heap (Priority Queue), Matrix, Simulation</description></item><item><title>2503. 网格查询的最大得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2503-maximum-number-of-points-from-grid-queries/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2503-maximum-number-of-points-from-grid-queries/</guid><description>Hard | Array, Two Pointers, Breadth-First Search, Union-Find, Sorting, Heap (Priority Queue), Matrix</description></item><item><title>2536. 将子矩阵元素增加一</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2536-increment-submatrices-by-one/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2536-increment-submatrices-by-one/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>2545. 按第K场考试分数排序学生</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2545-sort-the-students-by-their-kth-score/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2545-sort-the-students-by-their-kth-score/</guid><description>Medium | Array, Sorting, Matrix</description></item><item><title>2556. 最多翻转一次使二进制矩阵不连通</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2556-disconnect-path-in-a-binary-matrix-by-at-most-one-flip/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2556-disconnect-path-in-a-binary-matrix-by-at-most-one-flip/</guid><description>Medium | Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Matrix</description></item><item><title>2573. 寻找具有LCP的字符串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2573-find-the-string-with-lcp/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2573-find-the-string-with-lcp/</guid><description>Hard | Array, String, Dynamic Programming, Greedy, Union-Find, Matrix</description></item><item><title>2577. 访问网格中单元格的最短时间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2577-minimum-time-to-visit-a-cell-in-a-grid/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2577-minimum-time-to-visit-a-cell-in-a-grid/</guid><description>Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path</description></item><item><title>2596. 检查骑士巡游方案</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2596-check-knight-tour-configuration/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2596-check-knight-tour-configuration/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Matrix, Simulation</description></item><item><title>2614. 对角线上的质数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2614-prime-in-diagonal/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2614-prime-in-diagonal/</guid><description>Easy | Array, Math, Matrix, Number Theory</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>2639. 求网格的列宽度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2639-find-the-width-of-columns-of-a-grid/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2639-find-the-width-of-columns-of-a-grid/</guid><description>Easy | Array, Matrix</description></item><item><title>1284. 将二进制矩阵转换为零矩阵的最小翻转次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1284-minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1284-minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/</guid><description>Hard | Array, Hash Table, Bit Manipulation, Breadth-First Search, Matrix</description></item><item><title>1289. 最小下降路径和 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1289-minimum-falling-path-sum-ii/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1289-minimum-falling-path-sum-ii/</guid><description>Hard | Array, Dynamic Programming, Matrix</description></item><item><title>1292. 元素和小于等于阈值的正方形的最大边长</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/</guid><description>Medium | Array, Binary Search, Matrix, Prefix Sum</description></item><item><title>1293. 网格中的最短路径（可消除障碍物）</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1293-shortest-path-in-a-grid-with-obstacles-elimination/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1293-shortest-path-in-a-grid-with-obstacles-elimination/</guid><description>Hard | Array, Breadth-First Search, Matrix</description></item><item><title>1314. 矩阵区域和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1314-matrix-block-sum/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1314-matrix-block-sum/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>1329. 对角线排序</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1329-sort-the-matrix-diagonally/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1329-sort-the-matrix-diagonally/</guid><description>Medium | Array, Sorting, Matrix</description></item><item><title>1351. 统计有序矩阵中的负数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1351-count-negative-numbers-in-a-sorted-matrix/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1351-count-negative-numbers-in-a-sorted-matrix/</guid><description>Easy | Array, Binary Search, Matrix</description></item><item><title>1368. 使网格中至少有一条有效路径的最小代价</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid/</guid><description>Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path</description></item><item><title>1391. 检查网格中是否存在有效路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1391-check-if-there-is-a-valid-path-in-a-grid/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1391-check-if-there-is-a-valid-path-in-a-grid/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix</description></item><item><title>1463. 摘樱桃 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1463-cherry-pickup-ii/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1463-cherry-pickup-ii/</guid><description>Hard | Array, Dynamic Programming, Matrix</description></item><item><title>1476. 子矩形查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1476-subrectangle-queries/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1476-subrectangle-queries/</guid><description>Medium | Array, Design, Matrix</description></item><item><title>1572. 矩阵对角线元素的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1572-matrix-diagonal-sum/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1572-matrix-diagonal-sum/</guid><description>Easy | Array, Matrix</description></item><item><title>1591. 奇怪的打印机 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1591-strange-printer-ii/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1591-strange-printer-ii/</guid><description>Hard | Array, Graph Theory, Topological Sort, Matrix</description></item><item><title>1594. 矩阵中的最大非负积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1594-maximum-non-negative-product-in-a-matrix/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1594-maximum-non-negative-product-in-a-matrix/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>1605. 根据行和列的和找到有效矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1605-find-valid-matrix-given-row-and-column-sums/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1605-find-valid-matrix-given-row-and-column-sums/</guid><description>Medium | Array, Greedy, Matrix</description></item><item><title>1632. 矩阵的秩变换</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1632-rank-transform-of-a-matrix/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1632-rank-transform-of-a-matrix/</guid><description>Hard | Array, Union-Find, Graph Theory, Topological Sort, Sorting, Matrix</description></item><item><title>1672. 最富有客户的资产总量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1672-richest-customer-wealth/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1672-richest-customer-wealth/</guid><description>Easy | Array, Matrix</description></item><item><title>1706. 球会落到何处</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1706-where-will-the-ball-fall/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1706-where-will-the-ball-fall/</guid><description>Medium | Array, Matrix, Simulation</description></item><item><title>1738. 找到第 K 大的异或坐标值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1738-find-kth-largest-xor-coordinate-value/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1738-find-kth-largest-xor-coordinate-value/</guid><description>Medium | Array, Divide and Conquer, Bit Manipulation, Sorting, Heap (Priority Queue), Matrix, Prefix Sum, Quickselect</description></item><item><title>1878. 获取网格中最大的三个菱形和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1878-get-biggest-three-rhombus-sums-in-a-grid/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1878-get-biggest-three-rhombus-sums-in-a-grid/</guid><description>Medium | Array, Math, Sorting, Heap (Priority Queue), Matrix, Prefix Sum</description></item><item><title>1886. 通过旋转矩阵判断是否可达</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1886-determine-whether-matrix-can-be-obtained-by-rotation/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1886-determine-whether-matrix-can-be-obtained-by-rotation/</guid><description>Easy | Array, Matrix</description></item><item><title>1895. 最大魔方阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1895-largest-magic-square/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1895-largest-magic-square/</guid><description>Medium | Array, Matrix, Prefix Sum</description></item><item><title>1901. 寻找二维数组中的峰值 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1901-find-a-peak-element-ii/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1901-find-a-peak-element-ii/</guid><description>Medium | Array, Binary Search, Matrix</description></item><item><title>1905. 统计子岛屿</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1905-count-sub-islands/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1905-count-sub-islands/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix</description></item><item><title>1937. 最大点数获取</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1937-maximum-number-of-points-with-cost/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1937-maximum-number-of-points-with-cost/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>1958. 检查移动合法性</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1958-check-if-move-is-legal/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1958-check-if-move-is-legal/</guid><description>Medium | Array, Matrix, Enumeration</description></item><item><title>1970. 最后一天还能穿越的日子</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1970-last-day-where-you-can-still-cross/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1970-last-day-where-you-can-still-cross/</guid><description>Hard | Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Matrix</description></item><item><title>1975. 最大矩阵和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1975-maximum-matrix-sum/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1975-maximum-matrix-sum/</guid><description>Medium | Array, Greedy, Matrix</description></item><item><title>1981. 最小化目标值与所选元素和的差值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1981-minimize-the-difference-between-target-and-chosen-elements/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1981-minimize-the-difference-between-target-and-chosen-elements/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>1020. 飞地的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1020-number-of-enclaves/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1020-number-of-enclaves/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix</description></item><item><title>1030. 距离顺序排列矩阵单元格</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1030-matrix-cells-in-distance-order/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1030-matrix-cells-in-distance-order/</guid><description>Easy | Array, Math, Geometry, Sorting, Matrix</description></item><item><title>1072. 翻转列以获得最大相等行数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1072-flip-columns-for-maximum-number-of-equal-rows/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1072-flip-columns-for-maximum-number-of-equal-rows/</guid><description>Medium | Array, Hash Table, Matrix</description></item><item><title>1074. 和为目标值的子矩阵数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1074-number-of-submatrices-that-sum-to-target/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1074-number-of-submatrices-that-sum-to-target/</guid><description>Hard | Array, Hash Table, Matrix, Prefix Sum</description></item><item><title>1091. 二进制矩阵中的最短路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1091-shortest-path-in-binary-matrix/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1091-shortest-path-in-binary-matrix/</guid><description>Medium | Array, Breadth-First Search, Matrix</description></item><item><title>1210. 穿过迷宫的最少移动次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1210-minimum-moves-to-reach-target-with-rotations/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1210-minimum-moves-to-reach-target-with-rotations/</guid><description>Hard | Array, Breadth-First Search, Matrix</description></item><item><title>1219. 黄金矿工</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1219-path-with-maximum-gold/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1219-path-with-maximum-gold/</guid><description>Medium | Array, Backtracking, Matrix</description></item><item><title>1222. 能够攻击国王的皇后</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1222-queens-that-can-attack-the-king/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1222-queens-that-can-attack-the-king/</guid><description>Medium | Array, Matrix, Simulation</description></item><item><title>1253. 重构 2 行二进制矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1253-reconstruct-a-2-row-binary-matrix/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1253-reconstruct-a-2-row-binary-matrix/</guid><description>Medium | Array, Greedy, Matrix</description></item><item><title>1254. 封闭岛屿的数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1254-number-of-closed-islands/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1254-number-of-closed-islands/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix</description></item><item><title>1260. 二维网格迁移</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1260-shift-2d-grid/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1260-shift-2d-grid/</guid><description>Easy | Array, Matrix, Simulation</description></item><item><title>1275. 找出井字棋的获胜者</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1275-find-winner-on-a-tic-tac-toe-game/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1275-find-winner-on-a-tic-tac-toe-game/</guid><description>Easy | Array, Hash Table, Matrix, Simulation</description></item><item><title>733. 图像渲染</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0733-flood-fill/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0733-flood-fill/</guid><description>Easy | Array, Depth-First Search, Breadth-First Search, Matrix</description></item><item><title>741. 摘樱桃</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0741-cherry-pickup/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0741-cherry-pickup/</guid><description>Hard | Array, Dynamic Programming, Matrix</description></item><item><title>766. 托普利茨矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0766-toeplitz-matrix/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0766-toeplitz-matrix/</guid><description>Easy | Array, Matrix</description></item><item><title>773. 滑动谜题</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0773-sliding-puzzle/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0773-sliding-puzzle/</guid><description>Hard | Array, Dynamic Programming, Backtracking, Breadth-First Search, Memoization, Matrix</description></item><item><title>778. 水位上升的泳池中游泳</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0778-swim-in-rising-water/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0778-swim-in-rising-water/</guid><description>Hard | Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix</description></item><item><title>782. 变换为棋盘</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0782-transform-to-chessboard/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0782-transform-to-chessboard/</guid><description>Hard | Array, Math, Bit Manipulation, Matrix</description></item><item><title>803. 打砖块</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0803-bricks-falling-when-hit/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0803-bricks-falling-when-hit/</guid><description>Hard | Array, Union-Find, Matrix</description></item><item><title>807. 保持城市天际线的最大高度增加</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0807-max-increase-to-keep-city-skyline/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0807-max-increase-to-keep-city-skyline/</guid><description>Medium | Array, Greedy, Matrix</description></item><item><title>840. 网格中的幻方</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0840-magic-squares-in-grid/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0840-magic-squares-in-grid/</guid><description>Medium | Array, Hash Table, Math, Matrix</description></item><item><title>861. 翻转矩阵后的得分</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0861-score-after-flipping-matrix/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0861-score-after-flipping-matrix/</guid><description>Medium | Array, Greedy, Bit Manipulation, Matrix</description></item><item><title>867. 转置矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0867-transpose-matrix/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0867-transpose-matrix/</guid><description>Easy | Array, Matrix, Simulation</description></item><item><title>883. 3D 形体投影面积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0883-projection-area-of-3d-shapes/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0883-projection-area-of-3d-shapes/</guid><description>Easy | Array, Math, Geometry, Matrix</description></item><item><title>885. 螺旋矩阵 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0885-spiral-matrix-iii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0885-spiral-matrix-iii/</guid><description>Medium | Array, Matrix, Simulation</description></item><item><title>892. 三维形体的表面积</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0892-surface-area-of-3d-shapes/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0892-surface-area-of-3d-shapes/</guid><description>Easy | Array, Math, Geometry, Matrix</description></item><item><title>909. 蛇梯棋</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0909-snakes-and-ladders/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0909-snakes-and-ladders/</guid><description>Medium | Array, Breadth-First Search, Matrix</description></item><item><title>931. 下降路径最小和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0931-minimum-falling-path-sum/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0931-minimum-falling-path-sum/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>498. 对角线遍历</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0498-diagonal-traverse/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0498-diagonal-traverse/</guid><description>Medium | Array, Matrix, Simulation</description></item><item><title>529. 扫雷游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0529-minesweeper/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0529-minesweeper/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Matrix</description></item><item><title>566. 重塑矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0566-reshape-the-matrix/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0566-reshape-the-matrix/</guid><description>Easy | Array, Matrix, Simulation</description></item><item><title>661. 图像平滑器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0661-image-smoother/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0661-image-smoother/</guid><description>Easy | Array, Matrix</description></item><item><title>675. 砍树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0675-cut-off-trees-for-golf-event/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0675-cut-off-trees-for-golf-event/</guid><description>Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrix</description></item><item><title>329. 矩阵中的最长递增路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0329-longest-increasing-path-in-a-matrix/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0329-longest-increasing-path-in-a-matrix/</guid><description>Hard | Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrix</description></item><item><title>378. 有序矩阵中第K小的元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0378-kth-smallest-element-in-a-sorted-matrix/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0378-kth-smallest-element-in-a-sorted-matrix/</guid><description>Medium | Array, Binary Search, Sorting, Heap (Priority Queue), Matrix</description></item><item><title>417. 太平洋大西洋水流问题</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0417-pacific-atlantic-water-flow/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0417-pacific-atlantic-water-flow/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Matrix</description></item><item><title>130. 被围绕的区域</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0130-surrounded-regions/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0130-surrounded-regions/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix</description></item><item><title>174. 地下城游戏</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0174-dungeon-game/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0174-dungeon-game/</guid><description>Hard | Array, Dynamic Programming, Matrix</description></item><item><title>200. 岛屿数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0200-number-of-islands/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0200-number-of-islands/</guid><description>Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix</description></item><item><title>212. 单词搜索 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0212-word-search-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0212-word-search-ii/</guid><description>Hard | Array, String, Backtracking, Trie, Matrix</description></item><item><title>240. 搜索二维矩阵 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0240-search-a-2d-matrix-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0240-search-a-2d-matrix-ii/</guid><description>Medium | Array, Binary Search, Divide and Conquer, Matrix</description></item><item><title>304. 二维区域和检索 - 矩阵不可变</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0304-range-sum-query-2d-immutable/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0304-range-sum-query-2d-immutable/</guid><description>Medium | Array, Design, Matrix, Prefix Sum</description></item><item><title>48. 旋转图像</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0048-rotate-image/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0048-rotate-image/</guid><description>Medium | Array, Math, Matrix</description></item><item><title>54. 螺旋矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0054-spiral-matrix/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0054-spiral-matrix/</guid><description>Medium | Array, Matrix, Simulation</description></item><item><title>59. 螺旋矩阵 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0059-spiral-matrix-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0059-spiral-matrix-ii/</guid><description>Medium | Array, Matrix, Simulation</description></item><item><title>63. 不同路径 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0063-unique-paths-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0063-unique-paths-ii/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>64. 最小路径和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0064-minimum-path-sum/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0064-minimum-path-sum/</guid><description>Medium | Array, Dynamic Programming, Matrix</description></item><item><title>73. 矩阵置零</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0073-set-matrix-zeroes/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0073-set-matrix-zeroes/</guid><description>Medium | Array, Hash Table, Matrix</description></item><item><title>74. 搜索二维矩阵</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0074-search-a-2d-matrix/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0074-search-a-2d-matrix/</guid><description>Medium | Array, Binary Search, Matrix</description></item><item><title>79. 单词搜索</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0079-word-search/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0079-word-search/</guid><description>Medium | Array, String, Backtracking, Depth-First Search, Matrix</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>