话题分类 > 二分查找
| # | 题目 | 标签 | 难度 |
|---|---|---|---|
| 2141 | 同时运行 N 台电脑的最长时间 | [贪心] [数组] [二分查找] [排序] | Hard |
| 2137 | Pour Water Between Buckets to Make Water Levels Equal 🔒 | [数组] [二分查找] | Medium |
| 2111 | 使数组 K 递增的最少操作次数 | [数组] [二分查找] | Hard |
| 2106 | 摘水果 | [数组] [二分查找] [前缀和] [滑动窗口] | Hard |
| 2089 | 找出数组排序后的目标下标 | [数组] [二分查找] [排序] | Easy |
| 2080 | 区间内查询数字的频率 | [设计] [线段树] [数组] [哈希表] [二分查找] | Medium |
| 2071 | 你可以安排的最多任务数目 | [贪心] [队列] [数组] [二分查找] [排序] [单调队列] | Hard |
| 2070 | 每一个查询的最大美丽值 | [数组] [二分查找] [排序] | Medium |
| 2064 | 分配给商店的最多商品的最小值 | [数组] [二分查找] | Medium |
| 2055 | 蜡烛之间的盘子 | [数组] [字符串] [二分查找] [前缀和] | Medium |
| 2054 | 两个最好的不重叠活动 | [数组] [二分查找] [动态规划] [排序] [堆（优先队列）] | Medium |
| 2040 | 两个有序数组的第 K 小乘积 | [数组] [二分查找] | Hard |
| 2035 | 将数组分成两个数组并最小化数组和的差 | [位运算] [数组] [双指针] [二分查找] [动态规划] [状态压缩] [有序集合] | Hard |
| 2031 | 1 比 0 多的子数组个数 🔒 | [树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] | Medium |
| 2024 | 考试的最大困扰度 | [字符串] [二分查找] [前缀和] [滑动窗口] | Medium |
| 2009 | 使数组连续的最少操作数 | [数组] [二分查找] | Hard |
| 2008 | 出租车的最大盈利 | [数组] [二分查找] [动态规划] [排序] | Medium |
| 1970 | 你能穿过矩阵的最后一天 | [深度优先搜索] [广度优先搜索] [并查集] [数组] [二分查找] [矩阵] | Hard |
| 1964 | 找出到每个位置为止最长的有效障碍赛跑路线 | [树状数组] [数组] [二分查找] | Hard |
| 1956 | 感染 K 种病毒所需的最短时间 🔒 | [几何] [数组] [数学] [二分查找] [枚举] | Hard |
| 1954 | 收集足够苹果的最小花园周长 | [数学] [二分查找] | Medium |
| 1932 | 合并多棵二叉搜索树 | [树] [深度优先搜索] [哈希表] [二分查找] [二叉树] | Hard |
| 1923 | 最长公共子路径 | [数组] [二分查找] [后缀数组] [哈希函数] [滚动哈希] | Hard |
| 1918 | 第 K 小的子数组和· 🔒 | [数组] [二分查找] [滑动窗口] | Medium |
| 1901 | 找出顶峰元素 II | [数组] [二分查找] [分治] [矩阵] | Medium |
| 1898 | 可移除字符的最大数目 | [数组] [字符串] [二分查找] | Medium |
| 1894 | 找到需要补充粉笔的学生编号 | [数组] [二分查找] [前缀和] [模拟] | Medium |
| 1891 | 割绳子 🔒 | [数组] [二分查找] | Medium |
| 1889 | 装包裹的最小浪费空间 | [数组] [二分查找] [前缀和] [排序] | Hard |
| 1885 | 统计数对 🔒 | [数组] [二分查找] [排序] | Medium |
| 1870 | 准时到达的列车最小时速 | [数组] [二分查找] | Medium |
| 1862 | 向下取整数对和 | [数组] [数学] [二分查找] [前缀和] | Hard |
| 1855 | 下标对中的最大距离 | [贪心] [数组] [双指针] [二分查找] | Medium |
| 1851 | 包含每个查询的最小区间 | [数组] [二分查找] [排序] [扫描线] [堆（优先队列）] | Hard |
| 1847 | 最近的房间 | [数组] [二分查找] [排序] | Hard |
| 1838 | 最高频元素的频数 | [数组] [二分查找] [前缀和] [滑动窗口] | Medium |
| 1818 | 绝对差值和 | [数组] [二分查找] [有序集合] [排序] | Medium |
| 1802 | 有界数组中指定下标处的最大值 | [贪心] [二分查找] | Medium |
| 1793 | 好子数组的最大分数 | [栈] [数组] [双指针] [二分查找] [单调栈] | Hard |
| 1782 | 统计点对的数目 | [图] [双指针] [二分查找] | Hard |
| 1760 | 袋子里最少数目的球 | [数组] [二分查找] | Medium |
| 1751 | 最多可以参加的会议数目 II | [数组] [二分查找] [动态规划] | Hard |
| 1739 | 放置盒子 | [贪心] [数学] [二分查找] | Hard |
| 1713 | 得到子序列的最少操作次数 | [贪心] [数组] [哈希表] [二分查找] | Hard |
| 1712 | 将数组分成三个子数组的方案数 | [数组] [双指针] [二分查找] [前缀和] | Medium |
| 1671 | 得到山形数组的最少删除次数 | [贪心] [数组] [二分查找] [动态规划] | Hard |
| 1658 | 将 x 减到 0 的最小操作数 | [数组] [哈希表] [二分查找] [前缀和] [滑动窗口] | Medium |
| 1649 | 通过指令创建有序数组 | [树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] | Hard |
| 1648 | 销售价值减少的颜色球 | [贪心] [数组] [数学] [二分查找] [排序] [堆（优先队列）] | Medium |
| 1631 | 最小体力消耗路径 | [深度优先搜索] [广度优先搜索] [并查集] [数组] [二分查找] [矩阵] [堆（优先队列）] | Medium |
| 1618 | 找出适应屏幕的最大字号 🔒 | [数组] [字符串] [二分查找] [交互] | Medium |
| 1608 | 特殊数组的特征值 | [数组] [二分查找] [排序] | Easy |
| 1574 | 删除最短的子数组使剩余数组有序 | [栈] [数组] [双指针] [二分查找] [单调栈] | Medium |
| 1562 | 查找大小为 M 的最新分组 | [数组] [二分查找] [模拟] | Medium |
| 1552 | 两球之间的磁力 | [数组] [二分查找] [排序] | Medium |
| 1539 | 第 k 个缺失的正整数 | [数组] [二分查找] | Easy |
| 1533 | 找到最大整数的索引 🔒 | [数组] [二分查找] [交互] | Medium |
| 1521 | 找到最接近目标值的函数值 | [位运算] [线段树] [数组] [二分查找] | Hard |
| 1508 | 子数组和排序后的区间和 | [数组] [双指针] [二分查找] [排序] | Medium |
| 1498 | 满足条件的子序列数目 | [数组] [双指针] [二分查找] [排序] | Medium |
| 1488 | 避免洪水泛滥 | [贪心] [数组] [哈希表] [二分查找] [堆（优先队列）] | Medium |
| 1483 | 树节点的第 K 个祖先 | [树] [深度优先搜索] [广度优先搜索] [设计] [二分查找] [动态规划] | Hard |
| 1482 | 制作 m 束花所需的最少天数 | [数组] [二分查找] | Medium |
| 1477 | 找两个和为目标值且不重叠的子数组 | [数组] [哈希表] [二分查找] [动态规划] [滑动窗口] | Medium |
| 1439 | 有序矩阵中的第 k 个最小数组和 | [数组] [二分查找] [矩阵] [堆（优先队列）] | Hard |
| 1428 | 至少有一个 1 的最左端列 🔒 | [数组] [二分查找] [交互] [矩阵] | Medium |
| 1385 | 两个数组间的距离值 | [数组] [双指针] [二分查找] [排序] | Easy |
| 1351 | 统计有序矩阵中的负数 | [数组] [二分查找] [矩阵] | Easy |
| 1348 | 推文计数 | [设计] [哈希表] [二分查找] [有序集合] [排序] | Medium |
| 1346 | 检查整数及其两倍数是否存在 | [数组] [哈希表] [双指针] [二分查找] [排序] | Easy |
| 1337 | 矩阵中战斗力最弱的 K 行 | [数组] [二分查找] [矩阵] [排序] [堆（优先队列）] | Easy |
| 1300 | 转变数组后最接近目标值的数组和 | [数组] [二分查找] [排序] | Medium |
| 1292 | 元素和小于等于阈值的正方形的最大边长 | [数组] [二分查找] [矩阵] [前缀和] | Medium |
| 1283 | 使结果不超过阈值的最小除数 | [数组] [二分查找] | Medium |
| 1237 | 找出给定方程的正整数解 | [数学] [双指针] [二分查找] [交互] | Medium |
| 1235 | 规划兼职工作 | [数组] [二分查找] [动态规划] [排序] | Hard |
| 1231 | 分享巧克力 🔒 | [数组] [二分查找] | Hard |
| 1214 | 查找两棵二叉搜索树之和 🔒 | [栈] [树] [深度优先搜索] [二叉搜索树] [双指针] [二分查找] [二叉树] | Medium |
| 1213 | 三个有序数组的交集 🔒 | [数组] [哈希表] [二分查找] [计数] | Easy |
| 1208 | 尽可能使字符串相等 | [字符串] [二分查找] [前缀和] [滑动窗口] | Medium |
| 1201 | 丑数 III | [数学] [二分查找] [数论] | Medium |
| 1198 | 找出所有行中最小公共元素 🔒 | [数组] [哈希表] [二分查找] [计数] [矩阵] | Medium |
| 1187 | 使数组严格递增 | [数组] [二分查找] [动态规划] | Hard |
| 1182 | 与目标颜色间的最短距离 🔒 | [数组] [二分查找] [动态规划] | Medium |
| 1170 | 比较字符串最小字母出现频次 | [数组] [哈希表] [字符串] [二分查找] [排序] | Medium |
| 1157 | 子数组中占绝大多数的元素 | [设计] [树状数组] [线段树] [数组] [二分查找] | Hard |
| 1150 | 检查一个数是否在数组中占绝大多数 🔒 | [数组] [二分查找] | Easy |
| 1146 | 快照数组 | [设计] [数组] [哈希表] [二分查找] | Medium |
| 1099 | 小于 K 的两数之和 🔒 | [数组] [双指针] [二分查找] [排序] | Easy |
| 1095 | 山脉数组中查找目标值 | [数组] [二分查找] [交互] | Hard |
| 1064 | 不动点 🔒 | [数组] [二分查找] | Easy |
| 1062 | 最长重复子串 🔒 | [字符串] [二分查找] [动态规划] [后缀数组] [哈希函数] [滚动哈希] | Medium |
| 1060 | 有序数组中的缺失元素 🔒 | [数组] [二分查找] | Medium |
| 1044 | 最长重复子串 | [字符串] [二分查找] [后缀数组] [滑动窗口] [哈希函数] [滚动哈希] | Hard |
| 1027 | 最长等差数列 | [数组] [哈希表] [二分查找] [动态规划] | Medium |
| 1011 | 在 D 天内送达包裹的能力 | [贪心] [数组] [二分查找] | Medium |
| 1004 | 最大连续1的个数 III | [数组] [二分查找] [前缀和] [滑动窗口] | Medium |
| 981 | 基于时间的键值存储 | [设计] [哈希表] [字符串] [二分查找] | Medium |
| 911 | 在线选举 | [设计] [数组] [哈希表] [二分查找] | Medium |
| 902 | 最大为 N 的数字组合 | [数组] [数学] [二分查找] [动态规划] | Hard |
| 888 | 公平的糖果交换 | [数组] [哈希表] [二分查找] [排序] | Easy |
| 887 | 鸡蛋掉落 | [数学] [二分查找] [动态规划] | Hard |
| 878 | 第 N 个神奇数字 | [数学] [二分查找] | Hard |
| 875 | 爱吃香蕉的珂珂 | [数组] [二分查找] | Medium |
| 862 | 和至少为 K 的最短子数组 | [队列] [数组] [二分查找] [前缀和] [滑动窗口] [单调队列] [堆（优先队列）] | Hard |
| 852 | 山脉数组的峰顶索引 | [数组] [二分查找] | Easy |
| 826 | 安排工作以达到最大收益 | [贪心] [数组] [双指针] [二分查找] [排序] | Medium |
| 825 | 适龄的朋友 | [数组] [双指针] [二分查找] [排序] | Medium |
| 793 | 阶乘函数后 K 个零 | [数学] [二分查找] | Hard |
| 786 | 第 K 个最小的素数分数 | [数组] [二分查找] [堆（优先队列）] | Hard |
| 778 | 水位上升的泳池中游泳 | [深度优先搜索] [广度优先搜索] [并查集] [数组] [二分查找] [矩阵] [堆（优先队列）] | Hard |
| 774 | 最小化去加油站的最大距离 🔒 | [数组] [二分查找] | Hard |
| 754 | 到达终点数字 | [数学] [二分查找] | Medium |
| 744 | 寻找比目标字母大的最小字母 | [数组] [二分查找] | Easy |
| 719 | 找出第 k 小的距离对 | [数组] [双指针] [二分查找] [排序] | Hard |
| 718 | 最长重复子数组 | [数组] [二分查找] [动态规划] [滑动窗口] [哈希函数] [滚动哈希] | Medium |
| 710 | 黑名单中的随机数 | [哈希表] [数学] [二分查找] [排序] [随机化] | Hard |
| 704 | 二分查找 | [数组] [二分查找] | Easy |
| 702 | 搜索长度未知的有序数组 🔒 | [数组] [二分查找] [交互] | Medium |
| 668 | 乘法表中第k小的数 | [二分查找] | Hard |
| 658 | 找到 K 个最接近的元素 | [数组] [双指针] [二分查找] [排序] [堆（优先队列）] | Medium |
| 644 | 子数组最大平均数 II 🔒 | [数组] [二分查找] | Hard |
| 633 | 平方数之和 | [数学] [双指针] [二分查找] | Medium |
| 611 | 有效三角形的个数 | [贪心] [数组] [双指针] [二分查找] [排序] | Medium |
| 540 | 有序数组中的单一元素 | [数组] [二分查找] | Medium |
| 532 | 数组中的 k-diff 数对 | [数组] [哈希表] [双指针] [二分查找] [排序] | Medium |
| 528 | 按权重随机选择 | [数学] [二分查找] [前缀和] [随机化] | Medium |
| 497 | 非重叠矩形中的随机点 | [水塘抽样] [数学] [二分查找] [有序集合] [前缀和] [随机化] | Medium |
| 493 | 翻转对 | [树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] | Hard |
| 483 | 最小好进制 | [数学] [二分查找] | Hard |
| 475 | 供暖器 | [数组] [双指针] [二分查找] [排序] | Medium |
| 456 | 132 模式 | [栈] [数组] [二分查找] [有序集合] [单调栈] | Medium |
| 441 | 排列硬币 | [数学] [二分查找] | Easy |
| 436 | 寻找右区间 | [数组] [二分查找] [排序] | Medium |
| 410 | 分割数组的最大值 | [贪心] [数组] [二分查找] [动态规划] | Hard |
| 400 | 第 N 位数字 | [数学] [二分查找] | Medium |
| 378 | 有序矩阵中第 K 小的元素 | [数组] [二分查找] [矩阵] [排序] [堆（优先队列）] | Medium |
| 374 | 猜数字大小 | [二分查找] [交互] | Easy |
| 367 | 有效的完全平方数 | [数学] [二分查找] | Easy |
| 363 | 矩形区域不超过 K 的最大数值和 | [数组] [二分查找] [动态规划] [矩阵] [有序集合] | Hard |
| 362 | 敲击计数器 🔒 | [设计] [队列] [数组] [哈希表] [二分查找] | Medium |
| 354 | 俄罗斯套娃信封问题 | [数组] [二分查找] [动态规划] [排序] | Hard |
| 352 | 将数据流变为多个不相交区间 | [设计] [二分查找] [有序集合] | Hard |
| 350 | 两个数组的交集 II | [数组] [哈希表] [双指针] [二分查找] [排序] | Easy |
| 349 | 两个数组的交集 | [数组] [哈希表] [双指针] [二分查找] [排序] | Easy |
| 327 | 区间和的个数 | [树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] | Hard |
| 315 | 计算右侧小于当前元素的个数 | [树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] | Hard |
| 302 | 包含全部黑色像素的最小矩形 🔒 | [深度优先搜索] [广度优先搜索] [数组] [二分查找] [矩阵] | Hard |
| 300 | 最长递增子序列 | [数组] [二分查找] [动态规划] | Medium |
| 287 | 寻找重复数 | [位运算] [数组] [双指针] [二分查找] | Medium |
| 278 | 第一个错误的版本 | [二分查找] [交互] | Easy |
| 275 | H 指数 II | [数组] [二分查找] | Medium |
| 270 | 最接近的二叉搜索树值 🔒 | [树] [深度优先搜索] [二叉搜索树] [二分查找] [二叉树] | Easy |
| 259 | 较小的三数之和 🔒 | [数组] [双指针] [二分查找] [排序] | Medium |
| 240 | 搜索二维矩阵 II | [数组] [二分查找] [分治] [矩阵] | Medium |
| 222 | 完全二叉树的节点个数 | [树] [深度优先搜索] [二分查找] [二叉树] | Medium |
| 209 | 长度最小的子数组 | [数组] [二分查找] [前缀和] [滑动窗口] | Medium |
| 167 | 两数之和 II - 输入有序数组 | [数组] [双指针] [二分查找] | Medium |
| 162 | 寻找峰值 | [数组] [二分查找] | Medium |
| 154 | 寻找旋转排序数组中的最小值 II | [数组] [二分查找] | Hard |
| 153 | 寻找旋转排序数组中的最小值 | [数组] [二分查找] | Medium |
| 81 | 搜索旋转排序数组 II | [数组] [二分查找] | Medium |
| 74 | 搜索二维矩阵 | [数组] [二分查找] [矩阵] | Medium |
| 69 | x 的平方根 | [数学] [二分查找] | Easy |
| 35 | 搜索插入位置 | [数组] [二分查找] | Easy |
| 34 | 在排序数组中查找元素的第一个和最后一个位置 | [数组] [二分查找] | Medium |
| 33 | 搜索旋转排序数组 | [数组] [二分查找] | Medium |
| 4 | 寻找两个正序数组的中位数 | [数组] [二分查找] [分治] | Hard |