2163 |
删除元素后和的最小差值 |
[数组] [动态规划] [堆(优先队列)] |
Hard |
2146 |
价格范围内最高排名的 K 样物品 |
[广度优先搜索] [数组] [矩阵] [排序] [堆(优先队列)] |
Medium |
2102 |
序列顺序查询 |
[设计] [数据流] [有序集合] [堆(优先队列)] |
Hard |
2099 |
找到和最大的长度为 K 的子序列 |
[数组] [哈希表] [排序] [堆(优先队列)] |
Easy |
2054 |
两个最好的不重叠活动 |
[数组] [二分查找] [动态规划] [排序] [堆(优先队列)] |
Medium |
2034 |
股票价格波动 |
[设计] [哈希表] [数据流] [有序集合] [堆(优先队列)] |
Medium |
2015 |
Average Height of Buildings in Each Segment 🔒 |
[贪心] [数组] [排序] [堆(优先队列)] |
Medium |
1985 |
找出数组中的第 K 大整数 |
[数组] [字符串] [分治] [快速选择] [排序] [堆(优先队列)] |
Medium |
1962 |
移除石子使总数最小 |
[数组] [堆(优先队列)] |
Medium |
1942 |
最小未被占据椅子的编号 |
[数组] [有序集合] [堆(优先队列)] |
Medium |
1912 |
设计电影租借系统 |
[设计] [数组] [哈希表] [有序集合] [堆(优先队列)] |
Hard |
1882 |
使用服务器处理任务 |
[数组] [堆(优先队列)] |
Medium |
1878 |
矩阵中最大的三个菱形和 |
[数组] [数学] [矩阵] [前缀和] [排序] [堆(优先队列)] |
Medium |
1851 |
包含每个查询的最小区间 |
[数组] [二分查找] [排序] [扫描线] [堆(优先队列)] |
Hard |
1845 |
座位预约管理系统 |
[设计] [堆(优先队列)] |
Medium |
1834 |
单线程 CPU |
[数组] [排序] [堆(优先队列)] |
Medium |
1825 |
求出 MK 平均值 |
[设计] [队列] [有序集合] [堆(优先队列)] |
Hard |
1810 |
隐藏网格下的最小消耗路径 🔒 |
[深度优先搜索] [广度优先搜索] [图] [交互] [堆(优先队列)] |
Medium |
1801 |
积压订单中的订单总数 |
[数组] [模拟] [堆(优先队列)] |
Medium |
1792 |
最大平均通过率 |
[贪心] [数组] [堆(优先队列)] |
Medium |
1786 |
从第一个节点出发到最后一个节点的受限路径数 |
[图] [拓扑排序] [动态规划] [最短路] [堆(优先队列)] |
Medium |
1776 |
车队 II |
[栈] [数组] [数学] [单调栈] [堆(优先队列)] |
Hard |
1753 |
移除石子的最大得分 |
[贪心] [数学] [堆(优先队列)] |
Medium |
1738 |
找出第 K 大的异或坐标值 |
[位运算] [数组] [分治] [矩阵] [前缀和] [快速选择] [堆(优先队列)] |
Medium |
1705 |
吃苹果的最大数目 |
[贪心] [数组] [堆(优先队列)] |
Medium |
1696 |
跳跃游戏 VI |
[队列] [数组] [动态规划] [滑动窗口] [单调队列] [堆(优先队列)] |
Medium |
1687 |
从仓库到码头运输箱子 |
[线段树] [队列] [数组] [动态规划] [单调队列] [堆(优先队列)] |
Hard |
1686 |
石子游戏 VI |
[贪心] [数组] [数学] [博弈] [排序] [堆(优先队列)] |
Medium |
1675 |
数组的最小偏移量 |
[贪心] [数组] [有序集合] [堆(优先队列)] |
Hard |
1648 |
销售价值减少的颜色球 |
[贪心] [数组] [数学] [二分查找] [排序] [堆(优先队列)] |
Medium |
1642 |
可以到达的最远建筑 |
[贪心] [数组] [堆(优先队列)] |
Medium |
1631 |
最小体力消耗路径 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [二分查找] [矩阵] [堆(优先队列)] |
Medium |
1606 |
找到处理最多请求的服务器 |
[贪心] [数组] [有序集合] [堆(优先队列)] |
Hard |
1514 |
概率最大的路径 |
[图] [最短路] [堆(优先队列)] |
Medium |
1500 |
设计文件分享系统 🔒 |
[设计] [哈希表] [数据流] [堆(优先队列)] |
Medium |
1499 |
满足不等式的最大值 |
[队列] [数组] [滑动窗口] [单调队列] [堆(优先队列)] |
Hard |
1488 |
避免洪水泛滥 |
[贪心] [数组] [哈希表] [二分查找] [堆(优先队列)] |
Medium |
1464 |
数组中两元素的最大乘积 |
[数组] [排序] [堆(优先队列)] |
Easy |
1439 |
有序矩阵中的第 k 个最小数组和 |
[数组] [二分查找] [矩阵] [堆(优先队列)] |
Hard |
1438 |
绝对差不超过限制的最长连续子数组 |
[队列] [数组] [有序集合] [滑动窗口] [单调队列] [堆(优先队列)] |
Medium |
1425 |
带限制的子序列和 |
[队列] [数组] [动态规划] [滑动窗口] [单调队列] [堆(优先队列)] |
Hard |
1424 |
对角线遍历 II |
[数组] [排序] [堆(优先队列)] |
Medium |
1405 |
最长快乐字符串 |
[贪心] [字符串] [堆(优先队列)] |
Medium |
1388 |
3n 块披萨 |
[贪心] [数组] [动态规划] [堆(优先队列)] |
Hard |
1383 |
最大的团队表现值 |
[贪心] [数组] [排序] [堆(优先队列)] |
Hard |
1368 |
使网格图至少有一条有效路径的最小代价 |
[广度优先搜索] [图] [数组] [矩阵] [最短路] [堆(优先队列)] |
Hard |
1354 |
多次求和构造目标数组 |
[数组] [堆(优先队列)] |
Hard |
1353 |
最多可以参加的会议数目 |
[贪心] [数组] [堆(优先队列)] |
Medium |
1338 |
数组大小减半 |
[贪心] [数组] [哈希表] [排序] [堆(优先队列)] |
Medium |
1337 |
矩阵中战斗力最弱的 K 行 |
[数组] [二分查找] [矩阵] [排序] [堆(优先队列)] |
Easy |
1263 |
推箱子 |
[广度优先搜索] [数组] [矩阵] [堆(优先队列)] |
Hard |
1199 |
建造街区的最短时间 🔒 |
[贪心] [数学] [堆(优先队列)] |
Hard |
1183 |
矩阵中 1 的最大数量 🔒 |
[贪心] [堆(优先队列)] |
Hard |
1172 |
餐盘栈 |
[栈] [设计] [哈希表] [堆(优先队列)] |
Hard |
1167 |
连接棒材的最低费用 🔒 |
[贪心] [数组] [堆(优先队列)] |
Medium |
1135 |
最低成本联通所有城市 🔒 |
[并查集] [图] [最小生成树] [堆(优先队列)] |
Medium |
1102 |
得分最高的路径 🔒 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] [堆(优先队列)] |
Medium |
1094 |
拼车 |
[数组] [前缀和] [排序] [模拟] [堆(优先队列)] |
Medium |
1054 |
距离相等的条形码 |
[贪心] [数组] [哈希表] [计数] [排序] [堆(优先队列)] |
Medium |
1046 |
最后一块石头的重量 |
[数组] [堆(优先队列)] |
Easy |
973 |
最接近原点的 K 个点 |
[几何] [数组] [数学] [分治] [快速选择] [排序] [堆(优先队列)] |
Medium |
912 |
排序数组 |
[数组] [分治] [桶排序] [计数排序] [基数排序] [排序] [堆(优先队列)] [归并排序] |
Medium |
882 |
细分图中的可到达结点 |
[图] [最短路] [堆(优先队列)] |
Hard |
871 |
最低加油次数 |
[贪心] [数组] [动态规划] [堆(优先队列)] |
Hard |
862 |
和至少为 K 的最短子数组 |
[队列] [数组] [二分查找] [前缀和] [滑动窗口] [单调队列] [堆(优先队列)] |
Hard |
857 |
雇佣 K 名工人的最低成本 |
[贪心] [数组] [排序] [堆(优先队列)] |
Hard |
787 |
K 站中转内最便宜的航班 |
[深度优先搜索] [广度优先搜索] [图] [动态规划] [最短路] [堆(优先队列)] |
Medium |
786 |
第 K 个最小的素数分数 |
[数组] [二分查找] [堆(优先队列)] |
Hard |
778 |
水位上升的泳池中游泳 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [二分查找] [矩阵] [堆(优先队列)] |
Hard |
767 |
重构字符串 |
[贪心] [哈希表] [字符串] [计数] [排序] [堆(优先队列)] |
Medium |
759 |
员工空闲时间 🔒 |
[数组] [排序] [堆(优先队列)] |
Hard |
743 |
网络延迟时间 |
[深度优先搜索] [广度优先搜索] [图] [最短路] [堆(优先队列)] |
Medium |
703 |
数据流中的第 K 大元素 |
[树] [设计] [二叉搜索树] [二叉树] [数据流] [堆(优先队列)] |
Easy |
692 |
前K个高频单词 |
[字典树] [哈希表] [字符串] [桶排序] [计数] [排序] [堆(优先队列)] |
Medium |
675 |
为高尔夫比赛砍树 |
[广度优先搜索] [数组] [矩阵] [堆(优先队列)] |
Hard |
659 |
分割数组为连续子序列 |
[贪心] [数组] [哈希表] [堆(优先队列)] |
Medium |
658 |
找到 K 个最接近的元素 |
[数组] [双指针] [二分查找] [排序] [堆(优先队列)] |
Medium |
632 |
最小区间 |
[贪心] [数组] [哈希表] [排序] [滑动窗口] [堆(优先队列)] |
Hard |
630 |
课程表 III |
[贪心] [数组] [堆(优先队列)] |
Hard |
621 |
任务调度器 |
[贪心] [数组] [哈希表] [计数] [排序] [堆(优先队列)] |
Medium |
506 |
相对名次 |
[数组] [排序] [堆(优先队列)] |
Easy |
505 |
迷宫 II 🔒 |
[深度优先搜索] [广度优先搜索] [图] [最短路] [堆(优先队列)] |
Medium |
502 |
IPO |
[贪心] [数组] [排序] [堆(优先队列)] |
Hard |
499 |
迷宫 III 🔒 |
[深度优先搜索] [广度优先搜索] [图] [最短路] [堆(优先队列)] |
Hard |
480 |
滑动窗口中位数 |
[数组] [哈希表] [滑动窗口] [堆(优先队列)] |
Hard |
451 |
根据字符出现频率排序 |
[哈希表] [字符串] [桶排序] [计数] [排序] [堆(优先队列)] |
Medium |
420 |
强密码检验器 |
[贪心] [字符串] [堆(优先队列)] |
Hard |
407 |
接雨水 II |
[广度优先搜索] [数组] [矩阵] [堆(优先队列)] |
Hard |
378 |
有序矩阵中第 K 小的元素 |
[数组] [二分查找] [矩阵] [排序] [堆(优先队列)] |
Medium |
373 |
查找和最小的 K 对数字 |
[数组] [堆(优先队列)] |
Medium |
358 |
K 距离间隔重排字符串 🔒 |
[贪心] [哈希表] [字符串] [计数] [排序] [堆(优先队列)] |
Hard |
355 |
设计推特 |
[设计] [哈希表] [链表] [堆(优先队列)] |
Medium |
347 |
前 K 个高频元素 |
[数组] [哈希表] [分治] [桶排序] [计数] [快速选择] [排序] [堆(优先队列)] |
Medium |
313 |
超级丑数 |
[数组] [哈希表] [数学] [动态规划] [堆(优先队列)] |
Medium |
295 |
数据流的中位数 |
[设计] [双指针] [数据流] [排序] [堆(优先队列)] |
Hard |
272 |
最接近的二叉搜索树值 II 🔒 |
[栈] [树] [深度优先搜索] [二叉搜索树] [双指针] [二叉树] [堆(优先队列)] |
Hard |
264 |
丑数 II |
[哈希表] [数学] [动态规划] [堆(优先队列)] |
Medium |
253 |
会议室 II 🔒 |
[贪心] [数组] [双指针] [排序] [堆(优先队列)] |
Medium |
239 |
滑动窗口最大值 |
[队列] [数组] [滑动窗口] [单调队列] [堆(优先队列)] |
Hard |
218 |
天际线问题 |
[树状数组] [线段树] [数组] [分治] [有序集合] [扫描线] [堆(优先队列)] |
Hard |
215 |
数组中的第K个最大元素 |
[数组] [分治] [快速选择] [排序] [堆(优先队列)] |
Medium |
23 |
合并K个升序链表 |
[链表] [分治] [堆(优先队列)] [归并排序] |
Hard |