话题分类 > 状态压缩
| # | 题目 | 标签 | 难度 |
|---|---|---|---|
| 2035 | 将数组分成两个数组并最小化数组和的差 | [位运算] [数组] [双指针] [二分查找] [动态规划] [状态压缩] [有序集合] | Hard |
| 2002 | 两个回文子序列长度的最大乘积 | [位运算] [字符串] [动态规划] [回溯] [状态压缩] | Medium |
| 1994 | 好子集的数目 | [位运算] [数组] [数学] [动态规划] [状态压缩] | Hard |
| 1986 | 完成任务的最少工作时间段 | [位运算] [数组] [动态规划] [回溯] [状态压缩] | Medium |
| 1947 | 最大兼容性评分和 | [位运算] [数组] [动态规划] [回溯] [状态压缩] | Medium |
| 1879 | 两个数组最小的异或值之和 | [位运算] [数组] [动态规划] [状态压缩] | Hard |
| 1815 | 得到新鲜甜甜圈的最多组数 | [位运算] [记忆化搜索] [数组] [动态规划] [状态压缩] | Hard |
| 1799 | N 次操作后的最大分数和 | [位运算] [数组] [数学] [动态规划] [回溯] [状态压缩] [数论] | Hard |
| 1755 | 最接近目标值的子序列和 | [位运算] [数组] [双指针] [动态规划] [状态压缩] | Hard |
| 1723 | 完成所有工作的最短时间 | [位运算] [数组] [动态规划] [回溯] [状态压缩] | Hard |
| 1681 | 最小不兼容性 | [位运算] [数组] [动态规划] [状态压缩] | Hard |
| 1659 | 最大化网格幸福感 | [位运算] [记忆化搜索] [动态规划] [状态压缩] | Hard |
| 1655 | 分配重复整数 | [位运算] [数组] [动态规划] [回溯] [状态压缩] | Hard |
| 1617 | 统计子树中城市之间最大距离 | [位运算] [树] [动态规划] [状态压缩] [枚举] | Hard |
| 1595 | 连通两组点的最小成本 | [位运算] [数组] [动态规划] [状态压缩] [矩阵] | Hard |
| 1494 | 并行课程 II | [位运算] [图] [动态规划] [状态压缩] | Hard |
| 1434 | 每个人戴不同帽子的方案数 | [位运算] [数组] [动态规划] [状态压缩] | Hard |
| 1349 | 参加考试的最大学生数 | [位运算] [数组] [动态规划] [状态压缩] [矩阵] | Hard |
| 1255 | 得分最高的单词集合 | [位运算] [数组] [字符串] [动态规划] [回溯] [状态压缩] | Hard |
| 1125 | 最小的必要团队 | [位运算] [数组] [动态规划] [状态压缩] | Hard |
| 1066 | 校园自行车分配 II 🔒 | [位运算] [数组] [动态规划] [回溯] [状态压缩] | Medium |
| 996 | 正方形数组的数目 | [位运算] [数组] [数学] [动态规划] [回溯] [状态压缩] | Hard |
| 943 | 最短超级串 | [位运算] [数组] [字符串] [动态规划] [状态压缩] | Hard |
| 847 | 访问所有节点的最短路径 | [位运算] [广度优先搜索] [图] [动态规划] [状态压缩] | Hard |
| 805 | 数组的均值分割 | [位运算] [数组] [数学] [动态规划] [状态压缩] | Hard |
| 698 | 划分为k个相等的子集 | [位运算] [记忆化搜索] [数组] [动态规划] [回溯] [状态压缩] | Medium |
| 691 | 贴纸拼词 | [位运算] [动态规划] [回溯] [状态压缩] | Hard |
| 638 | 大礼包 | [位运算] [记忆化搜索] [数组] [动态规划] [回溯] [状态压缩] | Medium |
| 526 | 优美的排列 | [位运算] [数组] [动态规划] [回溯] [状态压缩] | Medium |
| 473 | 火柴拼正方形 | [位运算] [数组] [动态规划] [回溯] [状态压缩] | Medium |
| 464 | 我能赢吗 | [位运算] [记忆化搜索] [数学] [动态规划] [状态压缩] [博弈] | Medium |