| 2166 |
设计位集 |
[设计] [数组] [哈希表] |
Medium |
| 2102 |
序列顺序查询 |
[设计] [数据流] [有序集合] [堆（优先队列）] |
Hard |
| 2080 |
区间内查询数字的频率 |
[设计] [线段树] [数组] [哈希表] [二分查找] |
Medium |
| 2069 |
模拟行走机器人 II |
[设计] [模拟] |
Medium |
| 2043 |
简易银行系统 |
[设计] [数组] [哈希表] [模拟] |
Medium |
| 2034 |
股票价格波动 |
[设计] [哈希表] [数据流] [有序集合] [堆（优先队列）] |
Medium |
| 2013 |
检测正方形 |
[设计] [数组] [哈希表] [计数] |
Medium |
| 1993 |
树上的操作 |
[树] [广度优先搜索] [设计] [哈希表] |
Medium |
| 1912 |
设计电影租借系统 |
[设计] [数组] [哈希表] [有序集合] [堆（优先队列）] |
Hard |
| 1865 |
找出和为指定值的下标对 |
[设计] [数组] [哈希表] |
Medium |
| 1845 |
座位预约管理系统 |
[设计] [堆（优先队列）] |
Medium |
| 1825 |
求出 MK 平均值 |
[设计] [队列] [有序集合] [堆（优先队列）] |
Hard |
| 1804 |
实现 Trie （前缀树） II 🔒 |
[设计] [字典树] [哈希表] [字符串] |
Medium |
| 1797 |
设计一个验证系统 |
[设计] [哈希表] |
Medium |
| 1756 |
设计最近使用（MRU）队列 🔒 |
[栈] [设计] [树状数组] [数组] [哈希表] [有序集合] |
Medium |
| 1670 |
设计前中后队列 |
[设计] [队列] [数组] [链表] [数据流] |
Medium |
| 1656 |
设计有序流 |
[设计] [数组] [哈希表] [数据流] |
Easy |
| 1628 |
设计带解析函数的表达式树 🔒 |
[栈] [树] [设计] [数学] [二叉树] |
Medium |
| 1622 |
奇妙序列 |
[设计] [线段树] [数学] |
Hard |
| 1603 |
设计停车系统 |
[设计] [计数] [模拟] |
Easy |
| 1600 |
皇位继承顺序 |
[树] [深度优先搜索] [设计] [哈希表] |
Medium |
| 1586 |
二叉搜索树迭代器 II 🔒 |
[栈] [树] [设计] [二叉搜索树] [二叉树] [迭代器] |
Medium |
| 1570 |
两个稀疏向量的点积 🔒 |
[设计] [数组] [哈希表] [双指针] |
Medium |
| 1500 |
设计文件分享系统 🔒 |
[设计] [哈希表] [数据流] [堆（优先队列）] |
Medium |
| 1483 |
树节点的第 K 个祖先 |
[树] [深度优先搜索] [广度优先搜索] [设计] [二分查找] [动态规划] |
Hard |
| 1476 |
子矩形查询 |
[设计] [数组] [矩阵] |
Medium |
| 1472 |
设计浏览器历史记录 |
[栈] [设计] [数组] [链表] [数据流] [双向链表] |
Medium |
| 1429 |
第一个唯一数字 🔒 |
[设计] [队列] [数组] [哈希表] [数据流] |
Medium |
| 1396 |
设计地铁系统 |
[设计] [哈希表] [字符串] |
Medium |
| 1381 |
设计一个支持增量操作的栈 |
[栈] [设计] [数组] |
Medium |
| 1357 |
每隔 n 个顾客打折 |
[设计] [数组] [哈希表] |
Medium |
| 1352 |
最后 K 个数的乘积 |
[设计] [队列] [数组] [数学] [数据流] |
Medium |
| 1348 |
推文计数 |
[设计] [哈希表] [二分查找] [有序集合] [排序] |
Medium |
| 1286 |
字母组合迭代器 |
[设计] [字符串] [回溯] [迭代器] |
Medium |
| 1261 |
在受污染的二叉树中查找元素 |
[树] [深度优先搜索] [广度优先搜索] [设计] [二叉树] |
Medium |
| 1244 |
力扣排行榜 🔒 |
[设计] [哈希表] [排序] |
Medium |
| 1206 |
设计跳表 |
[设计] [链表] |
Hard |
| 1172 |
餐盘栈 |
[栈] [设计] [哈希表] [堆（优先队列）] |
Hard |
| 1166 |
设计文件系统 🔒 |
[设计] [字典树] [哈希表] [字符串] |
Medium |
| 1157 |
子数组中占绝大多数的元素 |
[设计] [树状数组] [线段树] [数组] [二分查找] |
Hard |
| 1146 |
快照数组 |
[设计] [数组] [哈希表] [二分查找] |
Medium |
| 1032 |
字符流 |
[设计] [字典树] [数组] [字符串] [数据流] |
Hard |
| 981 |
基于时间的键值存储 |
[设计] [哈希表] [字符串] [二分查找] |
Medium |
| 933 |
最近的请求次数 |
[设计] [队列] [数据流] |
Easy |
| 919 |
完全二叉树插入器 |
[树] [广度优先搜索] [设计] [二叉树] |
Medium |
| 911 |
在线选举 |
[设计] [数组] [哈希表] [二分查找] |
Medium |
| 901 |
股票价格跨度 |
[栈] [设计] [数据流] [单调栈] |
Medium |
| 900 |
RLE 迭代器 |
[设计] [数组] [计数] [迭代器] |
Medium |
| 895 |
最大频率栈 |
[栈] [设计] [哈希表] [有序集合] |
Hard |
| 855 |
考场就座 |
[设计] [有序集合] |
Medium |
| 745 |
前缀和后缀搜索 |
[设计] [字典树] [字符串] |
Hard |
| 732 |
我的日程安排表 III |
[设计] [线段树] [有序集合] |
Hard |
| 731 |
我的日程安排表 II |
[设计] [线段树] [有序集合] |
Medium |
| 729 |
我的日程安排表 I |
[设计] [线段树] [有序集合] |
Medium |
| 716 |
最大栈 🔒 |
[栈] [设计] [链表] [双向链表] [有序集合] |
Easy |
| 715 |
Range 模块 |
[设计] [线段树] [有序集合] |
Hard |
| 707 |
设计链表 |
[设计] [链表] |
Medium |
| 706 |
设计哈希映射 |
[设计] [数组] [哈希表] [链表] [哈希函数] |
Easy |
| 705 |
设计哈希集合 |
[设计] [数组] [哈希表] [链表] [哈希函数] |
Easy |
| 703 |
数据流中的第 K 大元素 |
[树] [设计] [二叉搜索树] [二叉树] [数据流] [堆（优先队列）] |
Easy |
| 677 |
键值映射 |
[设计] [字典树] [哈希表] [字符串] |
Medium |
| 676 |
实现一个魔法字典 |
[设计] [字典树] [哈希表] [字符串] |
Medium |
| 642 |
设计搜索自动补全系统 🔒 |
[设计] [字典树] [字符串] [数据流] |
Hard |
| 641 |
设计循环双端队列 |
[设计] [队列] [数组] [链表] |
Medium |
| 635 |
设计日志存储系统 🔒 |
[设计] [哈希表] [字符串] [有序集合] |
Medium |
| 631 |
设计 Excel 求和公式 🔒 |
[图] [设计] [拓扑排序] |
Hard |
| 622 |
设计循环队列 |
[设计] [队列] [数组] [链表] |
Medium |
| 604 |
迭代压缩字符串 🔒 |
[设计] [数组] [哈希表] [字符串] [迭代器] |
Easy |
| 588 |
设计内存文件系统 🔒 |
[设计] [字典树] [哈希表] [字符串] |
Hard |
| 535 |
TinyURL 的加密与解密 |
[设计] [哈希表] [字符串] [哈希函数] |
Medium |
| 460 |
LFU 缓存 |
[设计] [哈希表] [链表] [双向链表] |
Hard |
| 449 |
序列化和反序列化二叉搜索树 |
[树] [深度优先搜索] [广度优先搜索] [设计] [二叉搜索树] [字符串] [二叉树] |
Medium |
| 432 |
全 O(1) 的数据结构 |
[设计] [哈希表] [链表] [双向链表] |
Hard |
| 431 |
将 N 叉树编码为二叉树 🔒 |
[树] [深度优先搜索] [广度优先搜索] [设计] [二叉树] |
Hard |
| 381 |
O(1) 时间插入、删除和获取随机元素 - 允许重复 |
[设计] [数组] [哈希表] [数学] [随机化] |
Hard |
| 380 |
O(1) 时间插入、删除和获取随机元素 |
[设计] [数组] [哈希表] [数学] [随机化] |
Medium |
| 379 |
电话目录管理系统 🔒 |
[设计] [队列] [数组] [哈希表] [链表] |
Medium |
| 362 |
敲击计数器 🔒 |
[设计] [队列] [数组] [哈希表] [二分查找] |
Medium |
| 359 |
日志速率限制器 🔒 |
[设计] [哈希表] |
Easy |
| 355 |
设计推特 |
[设计] [哈希表] [链表] [堆（优先队列）] |
Medium |
| 353 |
贪吃蛇 🔒 |
[设计] [队列] [数组] [矩阵] |
Medium |
| 352 |
将数据流变为多个不相交区间 |
[设计] [二分查找] [有序集合] |
Hard |
| 348 |
设计井字棋 🔒 |
[设计] [数组] [哈希表] [矩阵] |
Medium |
| 346 |
数据流中的移动平均值 🔒 |
[设计] [队列] [数组] [数据流] |
Easy |
| 341 |
扁平化嵌套列表迭代器 |
[栈] [树] [深度优先搜索] [设计] [队列] [迭代器] |
Medium |
| 308 |
二维区域和检索 - 可变 🔒 |
[设计] [树状数组] [线段树] [数组] [矩阵] |
Hard |
| 307 |
区域和检索 - 数组可修改 |
[设计] [树状数组] [线段树] [数组] |
Medium |
| 304 |
二维区域和检索 - 矩阵不可变 |
[设计] [数组] [矩阵] [前缀和] |
Medium |
| 303 |
区域和检索 - 数组不可变 |
[设计] [数组] [前缀和] |
Easy |
| 297 |
二叉树的序列化与反序列化 |
[树] [深度优先搜索] [广度优先搜索] [设计] [字符串] [二叉树] |
Hard |
| 295 |
数据流的中位数 |
[设计] [双指针] [数据流] [排序] [堆（优先队列）] |
Hard |
| 288 |
单词的唯一缩写 🔒 |
[设计] [数组] [哈希表] [字符串] |
Medium |
| 284 |
顶端迭代器 |
[设计] [数组] [迭代器] |
Medium |
| 281 |
锯齿迭代器 🔒 |
[设计] [队列] [数组] [迭代器] |
Medium |
| 271 |
字符串的编码与解码 🔒 |
[设计] [数组] [字符串] |
Medium |
| 251 |
展开二维向量 🔒 |
[设计] [数组] [双指针] [迭代器] |
Medium |
| 244 |
最短单词距离 II 🔒 |
[设计] [数组] [哈希表] [双指针] [字符串] |
Medium |
| 232 |
用栈实现队列 |
[栈] [设计] [队列] |
Easy |
| 225 |
用队列实现栈 |
[栈] [设计] [队列] |
Easy |
| 211 |
添加与搜索单词 - 数据结构设计 |
[深度优先搜索] [设计] [字典树] [字符串] |
Medium |
| 208 |
实现 Trie (前缀树) |
[设计] [字典树] [哈希表] [字符串] |
Medium |
| 173 |
二叉搜索树迭代器 |
[栈] [树] [设计] [二叉搜索树] [二叉树] [迭代器] |
Medium |
| 170 |
两数之和 III - 数据结构设计 🔒 |
[设计] [数组] [哈希表] [双指针] [数据流] |
Easy |
| 155 |
最小栈 |
[栈] [设计] |
Easy |
| 146 |
LRU 缓存 |
[设计] [哈希表] [链表] [双向链表] |
Medium |