话题分类 > 有序集合
| # | 题目 | 标签 | 难度 |
|---|---|---|---|
| 2158 | Amount of New Area Painted Each Day 🔒 | [线段树] [数组] [有序集合] | Hard |
| 2102 | 序列顺序查询 | [设计] [数据流] [有序集合] [堆（优先队列）] | Hard |
| 2035 | 将数组分成两个数组并最小化数组和的差 | [位运算] [数组] [双指针] [二分查找] [动态规划] [状态压缩] [有序集合] | Hard |
| 2034 | 股票价格波动 | [设计] [哈希表] [数据流] [有序集合] [堆（优先队列）] | Medium |
| 2031 | 1 比 0 多的子数组个数 🔒 | [树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] | Medium |
| 2021 | 街上最亮的位置 🔒 | [数组] [有序集合] [前缀和] | Medium |
| 1942 | 最小未被占据椅子的编号 | [数组] [有序集合] [堆（优先队列）] | Medium |
| 1912 | 设计电影租借系统 | [设计] [数组] [哈希表] [有序集合] [堆（优先队列）] | Hard |
| 1902 | 给定二叉搜索树的插入顺序求深度 🔒 | [树] [二叉搜索树] [二叉树] [有序集合] | Medium |
| 1825 | 求出 MK 平均值 | [设计] [队列] [有序集合] [堆（优先队列）] | Hard |
| 1818 | 绝对差值和 | [数组] [二分查找] [有序集合] [排序] | Medium |
| 1756 | 设计最近使用（MRU）队列 🔒 | [栈] [设计] [树状数组] [数组] [哈希表] [有序集合] | Medium |
| 1675 | 数组的最小偏移量 | [贪心] [数组] [有序集合] [堆（优先队列）] | Hard |
| 1649 | 通过指令创建有序数组 | [树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] | Hard |
| 1606 | 找到处理最多请求的服务器 | [贪心] [数组] [有序集合] [堆（优先队列）] | Hard |
| 1438 | 绝对差不超过限制的最长连续子数组 | [队列] [数组] [有序集合] [滑动窗口] [单调队列] [堆（优先队列）] | Medium |
| 1418 | 点菜展示表 | [数组] [哈希表] [字符串] [有序集合] [排序] | Medium |
| 1348 | 推文计数 | [设计] [哈希表] [二分查找] [有序集合] [排序] | Medium |
| 975 | 奇偶跳 | [栈] [数组] [动态规划] [有序集合] [单调栈] | Hard |
| 895 | 最大频率栈 | [栈] [设计] [哈希表] [有序集合] | Hard |
| 855 | 考场就座 | [设计] [有序集合] | Medium |
| 850 | 矩形面积 II | [线段树] [数组] [有序集合] [扫描线] | Hard |
| 732 | 我的日程安排表 III | [设计] [线段树] [有序集合] | Hard |
| 731 | 我的日程安排表 II | [设计] [线段树] [有序集合] | Medium |
| 729 | 我的日程安排表 I | [设计] [线段树] [有序集合] | Medium |
| 716 | 最大栈 🔒 | [栈] [设计] [链表] [双向链表] [有序集合] | Easy |
| 715 | Range 模块 | [设计] [线段树] [有序集合] | Hard |
| 699 | 掉落的方块 | [线段树] [数组] [有序集合] | Hard |
| 683 | K 个关闭的灯泡 🔒 | [树状数组] [数组] [有序集合] [滑动窗口] | Hard |
| 635 | 设计日志存储系统 🔒 | [设计] [哈希表] [字符串] [有序集合] | Medium |
| 497 | 非重叠矩形中的随机点 | [水塘抽样] [数学] [二分查找] [有序集合] [前缀和] [随机化] | Medium |
| 493 | 翻转对 | [树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] | Hard |
| 456 | 132 模式 | [栈] [数组] [二分查找] [有序集合] [单调栈] | Medium |
| 363 | 矩形区域不超过 K 的最大数值和 | [数组] [二分查找] [动态规划] [矩阵] [有序集合] | Hard |
| 352 | 将数据流变为多个不相交区间 | [设计] [二分查找] [有序集合] | Hard |
| 327 | 区间和的个数 | [树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] | Hard |
| 315 | 计算右侧小于当前元素的个数 | [树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] | Hard |
| 220 | 存在重复元素 III | [数组] [桶排序] [有序集合] [排序] [滑动窗口] | Medium |
| 218 | 天际线问题 | [树状数组] [线段树] [数组] [分治] [有序集合] [扫描线] [堆（优先队列）] | Hard |