话题分类 > 队列
# | 题目 | 标签 | 难度 |
---|---|---|---|
2073 | 买票需要的时间 | [队列] [数组] [模拟] | Easy |
2071 | 你可以安排的最多任务数目 | [贪心] [队列] [数组] [二分查找] [排序] [单调队列] | Hard |
1825 | 求出 MK 平均值 | [设计] [队列] [有序集合] [堆(优先队列)] | Hard |
1823 | 找出游戏的获胜者 | [递归] [队列] [数组] [数学] [模拟] | Medium |
1700 | 无法吃午餐的学生数量 | [栈] [队列] [数组] [模拟] | Easy |
1696 | 跳跃游戏 VI | [队列] [数组] [动态规划] [滑动窗口] [单调队列] [堆(优先队列)] | Medium |
1687 | 从仓库到码头运输箱子 | [线段树] [队列] [数组] [动态规划] [单调队列] [堆(优先队列)] | Hard |
1670 | 设计前中后队列 | [设计] [队列] [数组] [链表] [数据流] | Medium |
1499 | 满足不等式的最大值 | [队列] [数组] [滑动窗口] [单调队列] [堆(优先队列)] | Hard |
1438 | 绝对差不超过限制的最长连续子数组 | [队列] [数组] [有序集合] [滑动窗口] [单调队列] [堆(优先队列)] | Medium |
1429 | 第一个唯一数字 🔒 | [设计] [队列] [数组] [哈希表] [数据流] | Medium |
1425 | 带限制的子序列和 | [队列] [数组] [动态规划] [滑动窗口] [单调队列] [堆(优先队列)] | Hard |
1352 | 最后 K 个数的乘积 | [设计] [队列] [数组] [数学] [数据流] | Medium |
950 | 按递增顺序显示卡牌 | [队列] [数组] [排序] [模拟] | Medium |
936 | 戳印序列 | [栈] [贪心] [队列] [字符串] | Hard |
933 | 最近的请求次数 | [设计] [队列] [数据流] | Easy |
918 | 环形子数组的最大和 | [队列] [数组] [分治] [动态规划] [单调队列] | Medium |
862 | 和至少为 K 的最短子数组 | [队列] [数组] [二分查找] [前缀和] [滑动窗口] [单调队列] [堆(优先队列)] | Hard |
649 | Dota2 参议院 | [贪心] [队列] [字符串] | Medium |
641 | 设计循环双端队列 | [设计] [队列] [数组] [链表] | Medium |
622 | 设计循环队列 | [设计] [队列] [数组] [链表] | Medium |
387 | 字符串中的第一个唯一字符 | [队列] [哈希表] [字符串] [计数] | Easy |
379 | 电话目录管理系统 🔒 | [设计] [队列] [数组] [哈希表] [链表] | Medium |
362 | 敲击计数器 🔒 | [设计] [队列] [数组] [哈希表] [二分查找] | Medium |
353 | 贪吃蛇 🔒 | [设计] [队列] [数组] [矩阵] | Medium |
346 | 数据流中的移动平均值 🔒 | [设计] [队列] [数组] [数据流] | Easy |
341 | 扁平化嵌套列表迭代器 | [栈] [树] [深度优先搜索] [设计] [队列] [迭代器] | Medium |
281 | 锯齿迭代器 🔒 | [设计] [队列] [数组] [迭代器] | Medium |
239 | 滑动窗口最大值 | [队列] [数组] [滑动窗口] [单调队列] [堆(优先队列)] | Hard |
232 | 用栈实现队列 | [栈] [设计] [队列] | Easy |
225 | 用队列实现栈 | [栈] [设计] [队列] | Easy |