话题分类 > 分治
| # | 题目 | 标签 | 难度 |
|---|---|---|---|
| 2031 | 1 比 0 多的子数组个数 🔒 | [树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] | Medium |
| 1985 | 找出数组中的第 K 大整数 | [数组] [字符串] [分治] [快速选择] [排序] [堆（优先队列）] | Medium |
| 1982 | 从子集的和还原数组 | [数组] [分治] | Hard |
| 1901 | 找出顶峰元素 II | [数组] [二分查找] [分治] [矩阵] | Medium |
| 1738 | 找出第 K 大的异或坐标值 | [位运算] [数组] [分治] [矩阵] [前缀和] [快速选择] [堆（优先队列）] | Medium |
| 1649 | 通过指令创建有序数组 | [树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] | Hard |
| 1569 | 将子数组重新排序得到同一个二叉查找树的方案数 | [树] [并查集] [二叉搜索树] [记忆化搜索] [数组] [数学] [分治] [动态规划] [二叉树] [组合数学] | Hard |
| 1382 | 将二叉搜索树变平衡 | [贪心] [树] [深度优先搜索] [二叉搜索树] [分治] [二叉树] | Medium |
| 1274 | 矩形内船只的数目 🔒 | [数组] [分治] [交互] | Hard |
| 973 | 最接近原点的 K 个点 | [几何] [数组] [数学] [分治] [快速选择] [排序] [堆（优先队列）] | Medium |
| 932 | 漂亮数组 | [数组] [数学] [分治] | Medium |
| 918 | 环形子数组的最大和 | [队列] [数组] [分治] [动态规划] [单调队列] | Medium |
| 912 | 排序数组 | [数组] [分治] [桶排序] [计数排序] [基数排序] [排序] [堆（优先队列）] [归并排序] | Medium |
| 889 | 根据前序和后序遍历构造二叉树 | [树] [数组] [哈希表] [分治] [二叉树] | Medium |
| 654 | 最大二叉树 | [栈] [树] [数组] [分治] [二叉树] [单调栈] | Medium |
| 558 | 四叉树交集 | [树] [分治] | Medium |
| 493 | 翻转对 | [树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] | Hard |
| 427 | 建立四叉树 | [树] [数组] [分治] [矩阵] | Medium |
| 395 | 至少有 K 个重复字符的最长子串 | [哈希表] [字符串] [分治] [滑动窗口] | Medium |
| 372 | 超级次方 | [数学] [分治] | Medium |
| 347 | 前 K 个高频元素 | [数组] [哈希表] [分治] [桶排序] [计数] [快速选择] [排序] [堆（优先队列）] | Medium |
| 327 | 区间和的个数 | [树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] | Hard |
| 324 | 摆动排序 II | [数组] [分治] [快速选择] [排序] | Medium |
| 315 | 计算右侧小于当前元素的个数 | [树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] | Hard |
| 240 | 搜索二维矩阵 II | [数组] [二分查找] [分治] [矩阵] | Medium |
| 218 | 天际线问题 | [树状数组] [线段树] [数组] [分治] [有序集合] [扫描线] [堆（优先队列）] | Hard |
| 215 | 数组中的第K个最大元素 | [数组] [分治] [快速选择] [排序] [堆（优先队列）] | Medium |
| 190 | 颠倒二进制位 | [位运算] [分治] | Easy |
| 169 | 多数元素 | [数组] [哈希表] [分治] [计数] [排序] | Easy |
| 148 | 排序链表 | [链表] [双指针] [分治] [排序] [归并排序] | Medium |
| 109 | 有序链表转换二叉搜索树 | [树] [二叉搜索树] [链表] [分治] [二叉树] | Medium |
| 108 | 将有序数组转换为二叉搜索树 | [树] [二叉搜索树] [数组] [分治] [二叉树] | Easy |
| 106 | 从中序与后序遍历序列构造二叉树 | [树] [数组] [哈希表] [分治] [二叉树] | Medium |
| 105 | 从前序与中序遍历序列构造二叉树 | [树] [数组] [哈希表] [分治] [二叉树] | Medium |
| 53 | 最大子数组和 | [数组] [分治] [动态规划] | Easy |
| 23 | 合并K个升序链表 | [链表] [分治] [堆（优先队列）] [归并排序] | Hard |
| 4 | 寻找两个正序数组的中位数 | [数组] [二分查找] [分治] | Hard |