Skip to content

Latest commit

 

History

History
33 lines (31 loc) · 6.75 KB

README.md

File metadata and controls

33 lines (31 loc) · 6.75 KB

话题分类 > 线段树

#题目标签难度
2158Amount of New Area Painted Each Day 🔒[线段树] [数组] [有序集合]Hard
2080区间内查询数字的频率[设计] [线段树] [数组] [哈希表] [二分查找]Medium
20311 比 0 多的子数组个数 🔒[树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序]Medium
1687从仓库到码头运输箱子[线段树] [队列] [数组] [动态规划] [单调队列] [堆(优先队列)]Hard
1649通过指令创建有序数组[树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序]Hard
1622奇妙序列[设计] [线段树] [数学]Hard
1521找到最接近目标值的函数值[位运算] [线段树] [数组] [二分查找]Hard
1505最多 K 次交换相邻数位后得到的最小整数[贪心] [树状数组] [线段树] [字符串]Hard
1157子数组中占绝大多数的元素[设计] [树状数组] [线段树] [数组] [二分查找]Hard
850矩形面积 II[线段树] [数组] [有序集合] [扫描线]Hard
732我的日程安排表 III[设计] [线段树] [有序集合]Hard
731我的日程安排表 II[设计] [线段树] [有序集合]Medium
729我的日程安排表 I[设计] [线段树] [有序集合]Medium
715Range 模块[设计] [线段树] [有序集合]Hard
699掉落的方块[线段树] [数组] [有序集合]Hard
673最长递增子序列的个数[树状数组] [线段树] [数组] [动态规划]Medium
493翻转对[树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序]Hard
327区间和的个数[树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序]Hard
315计算右侧小于当前元素的个数[树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序]Hard
308二维区域和检索 - 可变 🔒[设计] [树状数组] [线段树] [数组] [矩阵]Hard
307区域和检索 - 数组可修改[设计] [树状数组] [线段树] [数组]Medium
218天际线问题[树状数组] [线段树] [数组] [分治] [有序集合] [扫描线] [堆(优先队列)]Hard
close