| 2146 |
价格范围内最高排名的 K 样物品 |
[广度优先搜索] [数组] [矩阵] [排序] [堆（优先队列）] |
Medium |
| 2133 |
检查是否每一行每一列都包含全部整数 |
[数组] [哈希表] [矩阵] |
Easy |
| 2132 |
用邮票贴满网格图 |
[贪心] [数组] [矩阵] [前缀和] |
Hard |
| 2128 |
Remove All Ones With Row and Column Flips 🔒 |
[位运算] [数组] [数学] [矩阵] |
Medium |
| 2125 |
银行中的激光束数量 |
[数组] [数学] [字符串] [矩阵] |
Medium |
| 2123 |
Minimum Operations to Remove Adjacent Ones in Matrix 🔒 |
[图] [数组] [矩阵] |
Hard |
| 2088 |
统计农场中肥沃金字塔的数目 |
[数组] [动态规划] [矩阵] |
Hard |
| 2087 |
网格图中机器人回家的最小代价 |
[贪心] [数组] [矩阵] |
Medium |
| 2061 |
扫地机器人清扫过的空间个数 🔒 |
[数组] [矩阵] [模拟] |
Medium |
| 2033 |
获取单值网格的最小操作数 |
[数组] [数学] [矩阵] [排序] |
Medium |
| 2022 |
将一维数组转变成二维数组 |
[数组] [矩阵] [模拟] |
Easy |
| 2018 |
判断单词是否能放入填字游戏内 |
[数组] [枚举] [矩阵] |
Medium |
| 2017 |
网格游戏 |
[数组] [矩阵] [前缀和] |
Medium |
| 1992 |
找到所有的农场组 |
[深度优先搜索] [广度优先搜索] [数组] [矩阵] |
Medium |
| 1981 |
最小化目标值与所选元素的差 |
[数组] [动态规划] [矩阵] |
Medium |
| 1975 |
最大方阵和 |
[贪心] [数组] [矩阵] |
Medium |
| 1970 |
你能穿过矩阵的最后一天 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [二分查找] [矩阵] |
Hard |
| 1958 |
检查操作是否合法 |
[数组] [枚举] [矩阵] |
Medium |
| 1926 |
迷宫中离入口最近的出口 |
[广度优先搜索] [数组] [矩阵] |
Medium |
| 1914 |
循环轮转矩阵 |
[数组] [矩阵] [模拟] |
Medium |
| 1905 |
统计子岛屿 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Medium |
| 1901 |
找出顶峰元素 II |
[数组] [二分查找] [分治] [矩阵] |
Medium |
| 1895 |
最大的幻方 |
[数组] [矩阵] [前缀和] |
Medium |
| 1886 |
判断矩阵经轮转后是否一致 |
[数组] [矩阵] |
Easy |
| 1878 |
矩阵中最大的三个菱形和 |
[数组] [数学] [矩阵] [前缀和] [排序] [堆（优先队列）] |
Medium |
| 1861 |
旋转盒子 |
[数组] [双指针] [矩阵] |
Medium |
| 1820 |
最多邀请的个数 🔒 |
[数组] [回溯] [矩阵] |
Medium |
| 1765 |
地图中的最高点 |
[广度优先搜索] [数组] [矩阵] |
Medium |
| 1738 |
找出第 K 大的异或坐标值 |
[位运算] [数组] [分治] [矩阵] [前缀和] [快速选择] [堆（优先队列）] |
Medium |
| 1730 |
获取食物的最短路径 🔒 |
[广度优先搜索] [数组] [矩阵] |
Medium |
| 1727 |
重新排列后的最大子矩阵 |
[贪心] [数组] [矩阵] [排序] |
Medium |
| 1706 |
球会落何处 |
[深度优先搜索] [数组] [动态规划] [矩阵] [模拟] |
Medium |
| 1672 |
最富有客户的资产总量 |
[数组] [矩阵] |
Easy |
| 1632 |
矩阵转换后的秩 |
[贪心] [并查集] [图] [拓扑排序] [数组] [矩阵] |
Hard |
| 1631 |
最小体力消耗路径 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [二分查找] [矩阵] [堆（优先队列）] |
Medium |
| 1605 |
给定行和列的和求可行矩阵 |
[贪心] [数组] [矩阵] |
Medium |
| 1595 |
连通两组点的最小成本 |
[位运算] [数组] [动态规划] [状态压缩] [矩阵] |
Hard |
| 1594 |
矩阵的最大非负积 |
[数组] [动态规划] [矩阵] |
Medium |
| 1591 |
奇怪的打印机 II |
[图] [拓扑排序] [数组] [矩阵] |
Hard |
| 1582 |
二进制矩阵中的特殊位置 |
[数组] [矩阵] |
Easy |
| 1572 |
矩阵对角线元素的和 |
[数组] [矩阵] |
Easy |
| 1568 |
使陆地分离的最少天数 |
[深度优先搜索] [广度优先搜索] [数组] [矩阵] [强连通分量] |
Hard |
| 1559 |
二维网格图中探测环 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Medium |
| 1536 |
排布二进制网格的最少交换次数 |
[贪心] [数组] [矩阵] |
Medium |
| 1504 |
统计全 1 子矩形 |
[栈] [数组] [动态规划] [矩阵] [单调栈] |
Medium |
| 1476 |
子矩形查询 |
[设计] [数组] [矩阵] |
Medium |
| 1463 |
摘樱桃 II |
[数组] [动态规划] [矩阵] |
Hard |
| 1444 |
切披萨的方案数 |
[记忆化搜索] [数组] [动态规划] [矩阵] |
Hard |
| 1439 |
有序矩阵中的第 k 个最小数组和 |
[数组] [二分查找] [矩阵] [堆（优先队列）] |
Hard |
| 1428 |
至少有一个 1 的最左端列 🔒 |
[数组] [二分查找] [交互] [矩阵] |
Medium |
| 1391 |
检查网格中是否存在有效路径 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Medium |
| 1380 |
矩阵中的幸运数 |
[数组] [矩阵] |
Easy |
| 1368 |
使网格图至少有一条有效路径的最小代价 |
[广度优先搜索] [图] [数组] [矩阵] [最短路] [堆（优先队列）] |
Hard |
| 1351 |
统计有序矩阵中的负数 |
[数组] [二分查找] [矩阵] |
Easy |
| 1349 |
参加考试的最大学生数 |
[位运算] [数组] [动态规划] [状态压缩] [矩阵] |
Hard |
| 1337 |
矩阵中战斗力最弱的 K 行 |
[数组] [二分查找] [矩阵] [排序] [堆（优先队列）] |
Easy |
| 1329 |
将矩阵按对角线排序 |
[数组] [矩阵] [排序] |
Medium |
| 1314 |
矩阵区域和 |
[数组] [矩阵] [前缀和] |
Medium |
| 1301 |
最大得分的路径数目 |
[数组] [动态规划] [矩阵] |
Hard |
| 1293 |
网格中的最短路径 |
[广度优先搜索] [数组] [矩阵] |
Hard |
| 1292 |
元素和小于等于阈值的正方形的最大边长 |
[数组] [二分查找] [矩阵] [前缀和] |
Medium |
| 1289 |
下降路径最小和 II |
[数组] [动态规划] [矩阵] |
Hard |
| 1284 |
转化为全零矩阵的最少反转次数 |
[位运算] [广度优先搜索] [数组] [矩阵] |
Hard |
| 1277 |
统计全为 1 的正方形子矩阵 |
[数组] [动态规划] [矩阵] |
Medium |
| 1275 |
找出井字棋的获胜者 |
[数组] [哈希表] [矩阵] [模拟] |
Easy |
| 1267 |
统计参与通信的服务器 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [计数] [矩阵] |
Medium |
| 1263 |
推箱子 |
[广度优先搜索] [数组] [矩阵] [堆（优先队列）] |
Hard |
| 1260 |
二维网格迁移 |
[数组] [矩阵] [模拟] |
Easy |
| 1254 |
统计封闭岛屿的数目 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Medium |
| 1253 |
重构 2 行二进制矩阵 |
[贪心] [数组] [矩阵] |
Medium |
| 1222 |
可以攻击国王的皇后 |
[数组] [矩阵] [模拟] |
Medium |
| 1219 |
黄金矿工 |
[数组] [回溯] [矩阵] |
Medium |
| 1210 |
穿过迷宫的最少移动次数 |
[广度优先搜索] [数组] [矩阵] |
Hard |
| 1198 |
找出所有行中最小公共元素 🔒 |
[数组] [哈希表] [二分查找] [计数] [矩阵] |
Medium |
| 1162 |
地图分析 |
[广度优先搜索] [数组] [动态规划] [矩阵] |
Medium |
| 1139 |
最大的以 1 为边界的正方形 |
[数组] [动态规划] [矩阵] |
Medium |
| 1102 |
得分最高的路径 🔒 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] [堆（优先队列）] |
Medium |
| 1091 |
二进制矩阵中的最短路径 |
[广度优先搜索] [数组] [矩阵] |
Medium |
| 1074 |
元素和为目标值的子矩阵数量 |
[数组] [哈希表] [矩阵] [前缀和] |
Hard |
| 1072 |
按列翻转得到最大值等行数 |
[数组] [哈希表] [矩阵] |
Medium |
| 1034 |
边界着色 |
[深度优先搜索] [广度优先搜索] [数组] [矩阵] |
Medium |
| 1030 |
距离顺序排列矩阵单元格 |
[几何] [数组] [数学] [矩阵] [排序] |
Easy |
| 1020 |
飞地的数量 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Medium |
| 999 |
可以被一步捕获的棋子数 |
[数组] [矩阵] [模拟] |
Easy |
| 994 |
腐烂的橘子 |
[广度优先搜索] [数组] [矩阵] |
Medium |
| 980 |
不同路径 III |
[位运算] [数组] [回溯] [矩阵] |
Hard |
| 934 |
最短的桥 |
[深度优先搜索] [广度优先搜索] [数组] [矩阵] |
Medium |
| 931 |
下降路径最小和 |
[数组] [动态规划] [矩阵] |
Medium |
| 928 |
尽量减少恶意软件的传播 II |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Hard |
| 924 |
尽量减少恶意软件的传播 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Hard |
| 909 |
蛇梯棋 |
[广度优先搜索] [数组] [矩阵] |
Medium |
| 892 |
三维形体的表面积 |
[几何] [数组] [数学] [矩阵] |
Easy |
| 885 |
螺旋矩阵 III |
[数组] [矩阵] [模拟] |
Medium |
| 883 |
三维形体投影面积 |
[几何] [数组] [数学] [矩阵] |
Easy |
| 867 |
转置矩阵 |
[数组] [矩阵] [模拟] |
Easy |
| 861 |
翻转矩阵后的得分 |
[贪心] [位运算] [数组] [矩阵] |
Medium |
| 840 |
矩阵中的幻方 |
[数组] [数学] [矩阵] |
Medium |
| 835 |
图像重叠 |
[数组] [矩阵] |
Medium |
| 832 |
翻转图像 |
[数组] [双指针] [矩阵] [模拟] |
Easy |
| 827 |
最大人工岛 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Hard |
| 807 |
保持城市天际线 |
[贪心] [数组] [矩阵] |
Medium |
| 803 |
打砖块 |
[并查集] [数组] [矩阵] |
Hard |
| 782 |
变为棋盘 |
[位运算] [数组] [数学] [矩阵] |
Hard |
| 778 |
水位上升的泳池中游泳 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [二分查找] [矩阵] [堆（优先队列）] |
Hard |
| 773 |
滑动谜题 |
[广度优先搜索] [数组] [矩阵] |
Hard |
| 766 |
托普利茨矩阵 |
[数组] [矩阵] |
Easy |
| 750 |
角矩形的数量 🔒 |
[数组] [数学] [动态规划] [矩阵] |
Medium |
| 749 |
隔离病毒 |
[深度优先搜索] [广度优先搜索] [数组] [矩阵] [模拟] |
Hard |
| 741 |
摘樱桃 |
[数组] [动态规划] [矩阵] |
Hard |
| 733 |
图像渲染 |
[深度优先搜索] [广度优先搜索] [数组] [矩阵] |
Easy |
| 723 |
粉碎糖果 🔒 |
[数组] [双指针] [矩阵] [模拟] |
Medium |
| 695 |
岛屿的最大面积 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Medium |
| 675 |
为高尔夫比赛砍树 |
[广度优先搜索] [数组] [矩阵] [堆（优先队列）] |
Hard |
| 661 |
图片平滑器 |
[数组] [矩阵] |
Easy |
| 568 |
最大休假天数 🔒 |
[数组] [动态规划] [矩阵] |
Hard |
| 566 |
重塑矩阵 |
[数组] [矩阵] [模拟] |
Easy |
| 562 |
矩阵中最长的连续1线段 🔒 |
[数组] [动态规划] [矩阵] |
Medium |
| 542 |
01 矩阵 |
[广度优先搜索] [数组] [动态规划] [矩阵] |
Medium |
| 533 |
孤独像素 II 🔒 |
[数组] [哈希表] [矩阵] |
Medium |
| 531 |
孤独像素 I 🔒 |
[数组] [哈希表] [矩阵] |
Medium |
| 529 |
扫雷游戏 |
[深度优先搜索] [广度优先搜索] [数组] [矩阵] |
Medium |
| 498 |
对角线遍历 |
[数组] [矩阵] [模拟] |
Medium |
| 463 |
岛屿的周长 |
[深度优先搜索] [广度优先搜索] [数组] [矩阵] |
Easy |
| 427 |
建立四叉树 |
[树] [数组] [分治] [矩阵] |
Medium |
| 422 |
有效的单词方块 🔒 |
[数组] [矩阵] |
Easy |
| 419 |
甲板上的战舰 |
[深度优先搜索] [数组] [矩阵] |
Medium |
| 417 |
太平洋大西洋水流问题 |
[深度优先搜索] [广度优先搜索] [数组] [矩阵] |
Medium |
| 407 |
接雨水 II |
[广度优先搜索] [数组] [矩阵] [堆（优先队列）] |
Hard |
| 378 |
有序矩阵中第 K 小的元素 |
[数组] [二分查找] [矩阵] [排序] [堆（优先队列）] |
Medium |
| 363 |
矩形区域不超过 K 的最大数值和 |
[数组] [二分查找] [动态规划] [矩阵] [有序集合] |
Hard |
| 361 |
轰炸敌人 🔒 |
[数组] [动态规划] [矩阵] |
Medium |
| 353 |
贪吃蛇 🔒 |
[设计] [队列] [数组] [矩阵] |
Medium |
| 348 |
设计井字棋 🔒 |
[设计] [数组] [哈希表] [矩阵] |
Medium |
| 317 |
离建筑物最近的距离 🔒 |
[广度优先搜索] [数组] [矩阵] |
Hard |
| 311 |
稀疏矩阵的乘法 🔒 |
[数组] [哈希表] [矩阵] |
Medium |
| 308 |
二维区域和检索 - 可变 🔒 |
[设计] [树状数组] [线段树] [数组] [矩阵] |
Hard |
| 304 |
二维区域和检索 - 矩阵不可变 |
[设计] [数组] [矩阵] [前缀和] |
Medium |
| 302 |
包含全部黑色像素的最小矩形 🔒 |
[深度优先搜索] [广度优先搜索] [数组] [二分查找] [矩阵] |
Hard |
| 296 |
最佳的碰头地点 🔒 |
[数组] [数学] [矩阵] [排序] |
Hard |
| 289 |
生命游戏 |
[数组] [矩阵] [模拟] |
Medium |
| 286 |
墙与门 🔒 |
[广度优先搜索] [数组] [矩阵] |
Medium |
| 240 |
搜索二维矩阵 II |
[数组] [二分查找] [分治] [矩阵] |
Medium |
| 221 |
最大正方形 |
[数组] [动态规划] [矩阵] |
Medium |
| 212 |
单词搜索 II |
[字典树] [数组] [字符串] [回溯] [矩阵] |
Hard |
| 200 |
岛屿数量 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Medium |
| 174 |
地下城游戏 |
[数组] [动态规划] [矩阵] |
Hard |
| 130 |
被围绕的区域 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Medium |
| 85 |
最大矩形 |
[栈] [数组] [动态规划] [矩阵] [单调栈] |
Hard |
| 79 |
单词搜索 |
[数组] [回溯] [矩阵] |
Medium |
| 74 |
搜索二维矩阵 |
[数组] [二分查找] [矩阵] |
Medium |
| 73 |
矩阵置零 |
[数组] [哈希表] [矩阵] |
Medium |
| 64 |
最小路径和 |
[数组] [动态规划] [矩阵] |
Medium |
| 63 |
不同路径 II |
[数组] [动态规划] [矩阵] |
Medium |
| 59 |
螺旋矩阵 II |
[数组] [矩阵] [模拟] |
Medium |
| 54 |
螺旋矩阵 |
[数组] [矩阵] [模拟] |
Medium |
| 48 |
旋转图像 |
[数组] [数学] [矩阵] |
Medium |
| 37 |
解数独 |
[数组] [回溯] [矩阵] |
Hard |
| 36 |
有效的数独 |
[数组] [哈希表] [矩阵] |
Medium |