话题分类 > 树状数组
| # | 题目 | 标签 | 难度 |
|---|---|---|---|
| 2031 | 1 比 0 多的子数组个数 🔒 | [树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] | Medium |
| 1964 | 找出到每个位置为止最长的有效障碍赛跑路线 | [树状数组] [数组] [二分查找] | Hard |
| 1756 | 设计最近使用（MRU）队列 🔒 | [栈] [设计] [树状数组] [数组] [哈希表] [有序集合] | Medium |
| 1649 | 通过指令创建有序数组 | [树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] | Hard |
| 1505 | 最多 K 次交换相邻数位后得到的最小整数 | [贪心] [树状数组] [线段树] [字符串] | Hard |
| 1409 | 查询带键的排列 | [树状数组] [数组] [模拟] | Medium |
| 1395 | 统计作战单位数 | [树状数组] [数组] [动态规划] | Medium |
| 1157 | 子数组中占绝大多数的元素 | [设计] [树状数组] [线段树] [数组] [二分查找] | Hard |
| 683 | K 个关闭的灯泡 🔒 | [树状数组] [数组] [有序集合] [滑动窗口] | Hard |
| 673 | 最长递增子序列的个数 | [树状数组] [线段树] [数组] [动态规划] | Medium |
| 493 | 翻转对 | [树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] | Hard |
| 327 | 区间和的个数 | [树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] | Hard |
| 315 | 计算右侧小于当前元素的个数 | [树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] | Hard |
| 308 | 二维区域和检索 - 可变 🔒 | [设计] [树状数组] [线段树] [数组] [矩阵] | Hard |
| 307 | 区域和检索 - 数组可修改 | [设计] [树状数组] [线段树] [数组] | Medium |
| 218 | 天际线问题 | [树状数组] [线段树] [数组] [分治] [有序集合] [扫描线] [堆（优先队列）] | Hard |