话题分类 > 贪心
# | 题目 | 标签 | 难度 |
---|---|---|---|
2170 | 使数组变成交替数组的最少操作数 | [贪心] [数组] [哈希表] [计数] | Medium |
2160 | 拆分数位后四位数字的最小和 | [贪心] [数学] [排序] | Easy |
2144 | 打折购买糖果的最小开销 | [贪心] [数组] [排序] | Easy |
2141 | 同时运行 N 台电脑的最长时间 | [贪心] [数组] [二分查找] [排序] | Hard |
2139 | 得到目标值的最少行动次数 | [贪心] [数学] | Medium |
2136 | 全部开花的最早一天 | [贪心] [数组] [排序] | Hard |
2132 | 用邮票贴满网格图 | [贪心] [数组] [矩阵] [前缀和] | Hard |
2131 | 连接两字母单词得到的最长回文串 | [贪心] [数组] [哈希表] [字符串] [计数] | Medium |
2126 | 摧毁小行星 | [贪心] [数组] [排序] | Medium |
2116 | 判断一个括号字符串是否有效 | [栈] [贪心] [字符串] | Medium |
2098 | Subsequence of Size K With the Largest Even Sum 🔒 | [贪心] [数组] [排序] | Medium |
2091 | 从数组中移除最大值和最小值 | [贪心] [数组] | Medium |
2087 | 网格图中机器人回家的最小代价 | [贪心] [数组] [矩阵] | Medium |
2086 | 从房屋收集雨水需要的最少水桶数 | [贪心] [字符串] [动态规划] | Medium |
2078 | 两栋颜色不同且距离最远的房子 | [贪心] [数组] | Easy |
2071 | 你可以安排的最多任务数目 | [贪心] [队列] [数组] [二分查找] [排序] [单调队列] | Hard |
2038 | 如果相邻两个颜色均相同则删除当前颜色 | [贪心] [数学] [字符串] [博弈] | Medium |
2030 | 含特定字母的最小子序列 | [栈] [贪心] [字符串] [单调栈] | Hard |
2029 | 石子游戏 IX | [贪心] [数组] [数学] [计数] [博弈] | Medium |
2027 | 转换字符串的最少操作次数 | [贪心] [字符串] | Easy |
2015 | Average Height of Buildings in Each Segment 🔒 | [贪心] [数组] [排序] [堆(优先队列)] | Medium |
2014 | 重复 K 次的最长子序列 | [贪心] [字符串] [回溯] [计数] [枚举] | Hard |
2007 | 从双倍数组中还原原数组 | [贪心] [数组] [哈希表] [排序] | Medium |
1996 | 游戏中弱角色的数量 | [栈] [贪心] [数组] [排序] [单调栈] | Medium |
1975 | 最大方阵和 | [贪心] [数组] [矩阵] | Medium |
1974 | 使用特殊打字机键入单词的最少时间 | [贪心] [字符串] | Easy |
1969 | 数组元素的最小非零乘积 | [贪心] [递归] [数学] | Medium |
1968 | 构造元素不等于两相邻元素平均值的数组 | [贪心] [数组] [排序] | Medium |
1963 | 使字符串平衡的最小交换次数 | [栈] [贪心] [双指针] [字符串] | Medium |
1953 | 你可以工作的最大周数 | [贪心] [数组] | Medium |
1946 | 子字符串突变后可能得到的最大整数 | [贪心] [数组] [字符串] | Medium |
1936 | 新增的最少台阶数 | [贪心] [数组] | Medium |
1927 | 求和游戏 | [贪心] [数学] [博弈] | Medium |
1921 | 消灭怪物的最大数量 | [贪心] [数组] [排序] | Medium |
1903 | 字符串中的最大奇数 | [贪心] [数学] [字符串] | Easy |
1899 | 合并若干三元组以形成目标三元组 | [贪心] [数组] | Medium |
1888 | 使二进制字符串字符交替的最少反转次数 | [贪心] [字符串] | Medium |
1881 | 插入后的最大值 | [贪心] [字符串] | Medium |
1877 | 数组中最大数对和的最小值 | [贪心] [数组] [双指针] [排序] | Medium |
1874 | 两个数组的最小乘积和 🔒 | [贪心] [数组] [排序] | Medium |
1864 | 构成交替字符串需要的最小交换次数 | [贪心] [字符串] | Medium |
1855 | 下标对中的最大距离 | [贪心] [数组] [双指针] [二分查找] | Medium |
1850 | 邻位交换的最小次数 | [贪心] [双指针] [字符串] | Medium |
1846 | 减小和重新排列数组后的最大元素 | [贪心] [数组] [排序] | Medium |
1833 | 雪糕的最大数量 | [贪心] [数组] [排序] | Medium |
1827 | 最少操作使数组递增 | [贪心] [数组] | Easy |
1824 | 最少侧跳次数 | [贪心] [数组] [动态规划] | Medium |
1802 | 有界数组中指定下标处的最大值 | [贪心] [二分查找] | Medium |
1798 | 你能构造出连续值的最大数目 | [贪心] [数组] | Medium |
1794 | 统计距离最小的子串对个数 🔒 | [贪心] [哈希表] [字符串] | Medium |
1792 | 最大平均通过率 | [贪心] [数组] [堆(优先队列)] | Medium |
1788 | 最大化花园的美观度 🔒 | [贪心] [数组] [前缀和] | Hard |
1785 | 构成特定和需要添加的最少元素 | [贪心] [数组] | Medium |
1775 | 通过最少操作次数使数组的和相等 | [贪心] [数组] [哈希表] [计数] | Medium |
1764 | 通过连接另一个数组的子数组得到一个数组 | [贪心] [数组] [字符串匹配] | Medium |
1754 | 构造字典序最大的合并字符串 | [贪心] [双指针] [字符串] | Medium |
1753 | 移除石子的最大得分 | [贪心] [数学] [堆(优先队列)] | Medium |
1739 | 放置盒子 | [贪心] [数学] [二分查找] | Hard |
1733 | 需要教语言的最少人数 | [贪心] [数组] | Medium |
1727 | 重新排列后的最大子矩阵 | [贪心] [数组] [矩阵] [排序] | Medium |
1717 | 删除子字符串的最大得分 | [栈] [贪心] [字符串] | Medium |
1713 | 得到子序列的最少操作次数 | [贪心] [数组] [哈希表] [二分查找] | Hard |
1710 | 卡车上的最大单元数 | [贪心] [数组] [排序] | Easy |
1708 | 长度为 K 的最大子数组 🔒 | [贪心] [数组] | Easy |
1705 | 吃苹果的最大数目 | [贪心] [数组] [堆(优先队列)] | Medium |
1703 | 得到连续 K 个 1 的最少相邻交换次数 | [贪心] [数组] [前缀和] [滑动窗口] | Hard |
1702 | 修改后的最大二进制字符串 | [贪心] [字符串] | Medium |
1689 | 十-二进制数的最少数目 | [贪心] [字符串] | Medium |
1686 | 石子游戏 VI | [贪心] [数组] [数学] [博弈] [排序] [堆(优先队列)] | Medium |
1675 | 数组的最小偏移量 | [贪心] [数组] [有序集合] [堆(优先队列)] | Hard |
1673 | 找出最具竞争力的子序列 | [栈] [贪心] [数组] [单调栈] | Medium |
1671 | 得到山形数组的最少删除次数 | [贪心] [数组] [二分查找] [动态规划] | Hard |
1665 | 完成所有任务的最少初始能量 | [贪心] [数组] [排序] | Hard |
1663 | 具有给定数值的最小字符串 | [贪心] [字符串] | Medium |
1648 | 销售价值减少的颜色球 | [贪心] [数组] [数学] [二分查找] [排序] [堆(优先队列)] | Medium |
1647 | 字符频次唯一的最小删除次数 | [贪心] [字符串] [排序] | Medium |
1642 | 可以到达的最远建筑 | [贪心] [数组] [堆(优先队列)] | Medium |
1632 | 矩阵转换后的秩 | [贪心] [并查集] [图] [拓扑排序] [数组] [矩阵] | Hard |
1616 | 分割两个字符串得到回文串 | [贪心] [双指针] [字符串] | Medium |
1606 | 找到处理最多请求的服务器 | [贪心] [数组] [有序集合] [堆(优先队列)] | Hard |
1605 | 给定行和列的和求可行矩阵 | [贪心] [数组] [矩阵] | Medium |
1589 | 所有排列中的最大和 | [贪心] [数组] [前缀和] [排序] | Medium |
1585 | 检查字符串是否可以通过排序子字符串得到另一个字符串 | [贪心] [字符串] [排序] | Hard |
1580 | 把箱子放进仓库里 II 🔒 | [贪心] [数组] [排序] | Medium |
1578 | 使绳子变成彩色的最短时间 | [贪心] [数组] [字符串] [动态规划] | Medium |
1567 | 乘积为正数的最长子数组长度 | [贪心] [数组] [动态规划] | Medium |
1564 | 把箱子放进仓库里 I 🔒 | [贪心] [数组] [排序] | Medium |
1561 | 你可以获得的最大硬币数目 | [贪心] [数组] [数学] [博弈] [排序] | Medium |
1558 | 得到目标数组的最少函数调用次数 | [贪心] [数组] | Medium |
1546 | 和为目标值且不重叠的非空子数组的最大数目 | [贪心] [数组] [哈希表] [前缀和] | Medium |
1541 | 平衡括号字符串的最少插入次数 | [栈] [贪心] [字符串] | Medium |
1537 | 最大得分 | [贪心] [数组] [双指针] [动态规划] | Hard |
1536 | 排布二进制网格的最少交换次数 | [贪心] [数组] [矩阵] | Medium |
1529 | 最少的后缀翻转次数 | [贪心] [字符串] | Medium |
1526 | 形成目标数组的子数组最少增加次数 | [栈] [贪心] [数组] [动态规划] [单调栈] | Hard |
1520 | 最多的不重叠子字符串 | [贪心] [字符串] | Hard |
1509 | 三次操作后最大值与最小值的最小差 | [贪心] [数组] [排序] | Medium |
1505 | 最多 K 次交换相邻数位后得到的最小整数 | [贪心] [树状数组] [线段树] [字符串] | Hard |
1488 | 避免洪水泛滥 | [贪心] [数组] [哈希表] [二分查找] [堆(优先队列)] | Medium |
1481 | 不同整数的最少数目 | [贪心] [数组] [哈希表] [计数] [排序] | Medium |
1465 | 切割后面积最大的蛋糕 | [贪心] [数组] [排序] | Medium |
1433 | 检查一个字符串是否可以打破另一个字符串 | [贪心] [字符串] [排序] | Medium |
1432 | 改变一个整数能得到的最大差值 | [贪心] [数学] | Medium |
1414 | 和为 K 的最少斐波那契数字数目 | [贪心] | Medium |
1405 | 最长快乐字符串 | [贪心] [字符串] [堆(优先队列)] | Medium |
1403 | 非递增顺序的最小子序列 | [贪心] [数组] [排序] | Easy |
1402 | 做菜顺序 | [贪心] [数组] [动态规划] [排序] | Hard |
1400 | 构造 K 个回文字符串 | [贪心] [哈希表] [字符串] [计数] | Medium |
1388 | 3n 块披萨 | [贪心] [数组] [动态规划] [堆(优先队列)] | Hard |
1386 | 安排电影院座位 | [贪心] [位运算] [数组] [哈希表] | Medium |
1383 | 最大的团队表现值 | [贪心] [数组] [排序] [堆(优先队列)] | Hard |
1382 | 将二叉搜索树变平衡 | [贪心] [树] [深度优先搜索] [二叉搜索树] [分治] [二叉树] | Medium |
1363 | 形成三的最大倍数 | [贪心] [数组] [动态规划] | Hard |
1353 | 最多可以参加的会议数目 | [贪心] [数组] [堆(优先队列)] | Medium |
1338 | 数组大小减半 | [贪心] [数组] [哈希表] [排序] [堆(优先队列)] | Medium |
1330 | 翻转子数组得到最大的数组值 | [贪心] [数组] [数学] | Hard |
1328 | 破坏回文串 | [贪心] [字符串] | Medium |
1326 | 灌溉花园的最少水龙头数目 | [贪心] [数组] [动态规划] | Hard |
1323 | 6 和 9 组成的最大数字 | [贪心] [数学] | Easy |
1296 | 划分数组为连续数字的集合 | [贪心] [数组] [哈希表] [排序] | Medium |
1262 | 可被三整除的最大和 | [贪心] [数组] [动态规划] | Medium |
1253 | 重构 2 行二进制矩阵 | [贪心] [数组] [矩阵] | Medium |
1247 | 交换字符使得字符串相同 | [贪心] [数学] [字符串] | Medium |
1221 | 分割平衡字符串 | [贪心] [字符串] [计数] | Easy |
1217 | 玩筹码 | [贪心] [数组] [数学] | Easy |
1199 | 建造街区的最短时间 🔒 | [贪心] [数学] [堆(优先队列)] | Hard |
1196 | 最多可以买到的苹果数量 🔒 | [贪心] [数组] [排序] | Easy |
1183 | 矩阵中 1 的最大数量 🔒 | [贪心] [堆(优先队列)] | Hard |
1167 | 连接棒材的最低费用 🔒 | [贪心] [数组] [堆(优先队列)] | Medium |
1147 | 段式回文 | [贪心] [双指针] [字符串] [动态规划] [哈希函数] [滚动哈希] | Hard |
1144 | 递减元素使数组呈锯齿状 | [贪心] [数组] | Medium |
1130 | 叶值的最小代价生成树 | [栈] [贪心] [动态规划] [单调栈] | Medium |
1121 | 将数组分成几个递增序列 🔒 | [贪心] [数组] | Hard |
1090 | 受标签影响的最大值 | [贪心] [数组] [哈希表] [计数] [排序] | Medium |
1081 | 不同字符的最小子序列 | [栈] [贪心] [字符串] [单调栈] | Medium |
1058 | 最小化舍入误差以满足目标 🔒 | [贪心] [数组] [数学] [字符串] | Medium |
1057 | 校园自行车分配 🔒 | [贪心] [数组] [排序] | Medium |
1055 | 形成字符串的最短路径 🔒 | [贪心] [字符串] [动态规划] | Medium |
1054 | 距离相等的条形码 | [贪心] [数组] [哈希表] [计数] [排序] [堆(优先队列)] | Medium |
1053 | 交换一次的先前排列 | [贪心] [数组] | Medium |
1029 | 两地调度 | [贪心] [数组] [排序] | Medium |
1024 | 视频拼接 | [贪心] [数组] [动态规划] | Medium |
1013 | 将数组分成和相等的三个部分 | [贪心] [数组] | Easy |
1011 | 在 D 天内送达包裹的能力 | [贪心] [数组] [二分查找] | Medium |
1007 | 行相等的最少多米诺旋转 | [贪心] [数组] | Medium |
1005 | K 次取反后最大化的数组和 | [贪心] [数组] [排序] | Easy |
991 | 坏了的计算器 | [贪心] [数学] | Medium |
984 | 不含 AAA 或 BBB 的字符串 | [贪心] [字符串] | Medium |
976 | 三角形的最大周长 | [贪心] [数组] [数学] [排序] | Easy |
969 | 煎饼排序 | [贪心] [数组] [双指针] [排序] | Medium |
955 | 删列造序 II | [贪心] [数组] [字符串] | Medium |
954 | 二倍数对数组 | [贪心] [数组] [哈希表] [排序] | Medium |
948 | 令牌放置 | [贪心] [数组] [双指针] [排序] | Medium |
945 | 使数组唯一的最小增量 | [贪心] [数组] [计数] [排序] | Medium |
942 | 增减字符串匹配 | [贪心] [数组] [数学] [双指针] [字符串] | Easy |
936 | 戳印序列 | [栈] [贪心] [队列] [字符串] | Hard |
921 | 使括号有效的最少添加 | [栈] [贪心] [字符串] | Medium |
910 | 最小差值 II | [贪心] [数组] [数学] [排序] | Medium |
881 | 救生艇 | [贪心] [数组] [双指针] [排序] | Medium |
871 | 最低加油次数 | [贪心] [数组] [动态规划] [堆(优先队列)] | Hard |
870 | 优势洗牌 | [贪心] [数组] [排序] | Medium |
861 | 翻转矩阵后的得分 | [贪心] [位运算] [数组] [矩阵] | Medium |
860 | 柠檬水找零 | [贪心] [数组] | Easy |
857 | 雇佣 K 名工人的最低成本 | [贪心] [数组] [排序] [堆(优先队列)] | Hard |
846 | 一手顺子 | [贪心] [数组] [哈希表] [排序] | Medium |
826 | 安排工作以达到最大收益 | [贪心] [数组] [双指针] [二分查找] [排序] | Medium |
807 | 保持城市天际线 | [贪心] [数组] [矩阵] | Medium |
781 | 森林中的兔子 | [贪心] [数组] [哈希表] [数学] | Medium |
769 | 最多能完成排序的块 | [栈] [贪心] [数组] [排序] [单调栈] | Medium |
768 | 最多能完成排序的块 II | [栈] [贪心] [数组] [排序] [单调栈] | Hard |
767 | 重构字符串 | [贪心] [哈希表] [字符串] [计数] [排序] [堆(优先队列)] | Medium |
765 | 情侣牵手 | [贪心] [深度优先搜索] [广度优先搜索] [并查集] [图] | Hard |
763 | 划分字母区间 | [贪心] [哈希表] [双指针] [字符串] | Medium |
757 | 设置交集大小至少为2 | [贪心] [数组] [排序] | Hard |
738 | 单调递增的数字 | [贪心] [数学] | Medium |
714 | 买卖股票的最佳时机含手续费 | [贪心] [数组] [动态规划] | Medium |
680 | 验证回文字符串 Ⅱ | [贪心] [双指针] [字符串] | Easy |
678 | 有效的括号字符串 | [栈] [贪心] [字符串] [动态规划] | Medium |
670 | 最大交换 | [贪心] [数学] | Medium |
659 | 分割数组为连续子序列 | [贪心] [数组] [哈希表] [堆(优先队列)] | Medium |
649 | Dota2 参议院 | [贪心] [队列] [字符串] | Medium |
646 | 最长数对链 | [贪心] [数组] [动态规划] [排序] | Medium |
632 | 最小区间 | [贪心] [数组] [哈希表] [排序] [滑动窗口] [堆(优先队列)] | Hard |
630 | 课程表 III | [贪心] [数组] [堆(优先队列)] | Hard |
625 | 最小因式分解 🔒 | [贪心] [数学] | Medium |
624 | 数组列表中的最大距离 🔒 | [贪心] [数组] | Medium |
621 | 任务调度器 | [贪心] [数组] [哈希表] [计数] [排序] [堆(优先队列)] | Medium |
611 | 有效三角形的个数 | [贪心] [数组] [双指针] [二分查找] [排序] | Medium |
605 | 种花问题 | [贪心] [数组] | Easy |
581 | 最短无序连续子数组 | [栈] [贪心] [数组] [双指针] [排序] [单调栈] | Medium |
561 | 数组拆分 I | [贪心] [数组] [计数排序] [排序] | Easy |
555 | 分割连接字符串 🔒 | [贪心] [数组] [字符串] | Medium |
527 | 单词缩写 🔒 | [贪心] [字典树] [数组] [字符串] [排序] | Hard |
517 | 超级洗衣机 | [贪心] [数组] | Hard |
502 | IPO | [贪心] [数组] [排序] [堆(优先队列)] | Hard |
484 | 寻找排列 🔒 | [栈] [贪心] [数组] | Medium |
455 | 分发饼干 | [贪心] [数组] [排序] | Easy |
452 | 用最少数量的箭引爆气球 | [贪心] [数组] [排序] | Medium |
435 | 无重叠区间 | [贪心] [数组] [动态规划] [排序] | Medium |
420 | 强密码检验器 | [贪心] [字符串] [堆(优先队列)] | Hard |
410 | 分割数组的最大值 | [贪心] [数组] [二分查找] [动态规划] | Hard |
409 | 最长回文串 | [贪心] [哈希表] [字符串] | Easy |
406 | 根据身高重建队列 | [贪心] [数组] [排序] | Medium |
402 | 移掉 K 位数字 | [栈] [贪心] [字符串] [单调栈] | Medium |
397 | 整数替换 | [贪心] [位运算] [记忆化搜索] [动态规划] | Medium |
376 | 摆动序列 | [贪心] [数组] [动态规划] | Medium |
358 | K 距离间隔重排字符串 🔒 | [贪心] [哈希表] [字符串] [计数] [排序] [堆(优先队列)] | Hard |
334 | 递增的三元子序列 | [贪心] [数组] | Medium |
330 | 按要求补齐数组 | [贪心] [数组] | Hard |
321 | 拼接最大数 | [栈] [贪心] [单调栈] | Hard |
316 | 去除重复字母 | [栈] [贪心] [字符串] [单调栈] | Medium |
280 | 摆动排序 🔒 | [贪心] [数组] [排序] | Medium |
277 | 搜寻名人 🔒 | [贪心] [图] [双指针] [交互] | Medium |
253 | 会议室 II 🔒 | [贪心] [数组] [双指针] [排序] [堆(优先队列)] | Medium |
179 | 最大数 | [贪心] [字符串] [排序] | Medium |
135 | 分发糖果 | [贪心] [数组] | Hard |
134 | 加油站 | [贪心] [数组] | Medium |
122 | 买卖股票的最佳时机 II | [贪心] [数组] [动态规划] | Medium |
55 | 跳跃游戏 | [贪心] [数组] [动态规划] | Medium |
45 | 跳跃游戏 II | [贪心] [数组] [动态规划] | Medium |
44 | 通配符匹配 | [贪心] [递归] [字符串] [动态规划] | Hard |
11 | 盛最多水的容器 | [贪心] [数组] [双指针] | Medium |