话题分类 > 位运算
| # | 题目 | 标签 | 难度 |
|---|---|---|---|
| 2172 | 数组的最大与和 | [位运算] [数组] [动态规划] [状态压缩] | Hard |
| 2157 | 字符串分组 | [位运算] [并查集] [字符串] | Hard |
| 2152 | Minimum Number of Lines to Cover Points 🔒 | [位运算] [几何] [数组] [哈希表] [数学] [动态规划] [回溯] [状态压缩] | Medium |
| 2151 | 基于陈述统计最多好人数 | [位运算] [数组] [回溯] [枚举] | Hard |
| 2135 | 统计追加字母可以获得的单词数 | [位运算] [数组] [哈希表] [字符串] [排序] | Medium |
| 2128 | Remove All Ones With Row and Column Flips 🔒 | [位运算] [数组] [数学] [矩阵] | Medium |
| 2044 | 统计按位或能得到最大值的子集数目 | [位运算] [数组] [回溯] | Medium |
| 2035 | 将数组分成两个数组并最小化数组和的差 | [位运算] [数组] [双指针] [二分查找] [动态规划] [状态压缩] [有序集合] | Hard |
| 2002 | 两个回文子序列长度的最大乘积 | [位运算] [字符串] [动态规划] [回溯] [状态压缩] | Medium |
| 1994 | 好子集的数目 | [位运算] [数组] [数学] [动态规划] [状态压缩] | Hard |
| 1986 | 完成任务的最少工作时间段 | [位运算] [数组] [动态规划] [回溯] [状态压缩] | Medium |
| 1947 | 最大兼容性评分和 | [位运算] [数组] [动态规划] [回溯] [状态压缩] | Medium |
| 1915 | 最美子字符串的数目 | [位运算] [哈希表] [字符串] [前缀和] | Medium |
| 1908 | Nim 游戏 II 🔒 | [位运算] [脑筋急转弯] [数组] [数学] [动态规划] [博弈] | Medium |
| 1879 | 两个数组最小的异或值之和 | [位运算] [数组] [动态规划] [状态压缩] | Hard |
| 1863 | 找出所有子集的异或总和再求和 | [位运算] [数组] [数学] [回溯] [组合数学] | Easy |
| 1835 | 所有数对按位与结果的异或和 | [位运算] [数组] [数学] | Hard |
| 1829 | 每个查询的最大异或值 | [位运算] [数组] [前缀和] | Medium |
| 1815 | 得到新鲜甜甜圈的最多组数 | [位运算] [记忆化搜索] [数组] [动态规划] [状态压缩] | Hard |
| 1803 | 统计异或值在范围内的数对有多少 | [位运算] [字典树] [数组] | Hard |
| 1799 | N 次操作后的最大分数和 | [位运算] [数组] [数学] [动态规划] [回溯] [状态压缩] [数论] | Hard |
| 1787 | 使所有区间的异或结果为零 | [位运算] [数组] [动态规划] | Hard |
| 1763 | 最长的美好子字符串 | [位运算] [哈希表] [字符串] [滑动窗口] | Easy |
| 1755 | 最接近目标值的子序列和 | [位运算] [数组] [双指针] [动态规划] [状态压缩] | Hard |
| 1738 | 找出第 K 大的异或坐标值 | [位运算] [数组] [分治] [矩阵] [前缀和] [快速选择] [堆（优先队列）] | Medium |
| 1734 | 解码异或后的排列 | [位运算] [数组] | Medium |
| 1723 | 完成所有工作的最短时间 | [位运算] [数组] [动态规划] [回溯] [状态压缩] | Hard |
| 1720 | 解码异或后的数组 | [位运算] [数组] | Easy |
| 1707 | 与数组中元素的最大异或值 | [位运算] [字典树] [数组] | Hard |
| 1684 | 统计一致字符串的数目 | [位运算] [数组] [哈希表] [字符串] | Easy |
| 1681 | 最小不兼容性 | [位运算] [数组] [动态规划] [状态压缩] | Hard |
| 1680 | 连接连续二进制数字 | [位运算] [数学] [模拟] | Medium |
| 1659 | 最大化网格幸福感 | [位运算] [记忆化搜索] [动态规划] [状态压缩] | Hard |
| 1655 | 分配重复整数 | [位运算] [数组] [动态规划] [回溯] [状态压缩] | Hard |
| 1617 | 统计子树中城市之间最大距离 | [位运算] [树] [动态规划] [状态压缩] [枚举] | Hard |
| 1611 | 使整数变为 0 的最少操作次数 | [位运算] [记忆化搜索] [动态规划] | Hard |
| 1601 | 最多可达成的换楼请求数目 | [位运算] [数组] [回溯] [枚举] | Hard |
| 1595 | 连通两组点的最小成本 | [位运算] [数组] [动态规划] [状态压缩] [矩阵] | Hard |
| 1542 | 找出最长的超赞子字符串 | [位运算] [哈希表] [字符串] | Hard |
| 1525 | 字符串的好分割数目 | [位运算] [字符串] [动态规划] | Medium |
| 1521 | 找到最接近目标值的函数值 | [位运算] [线段树] [数组] [二分查找] | Hard |
| 1506 | 找到 N 叉树的根节点 🔒 | [位运算] [树] [深度优先搜索] [哈希表] | Medium |
| 1494 | 并行课程 II | [位运算] [图] [动态规划] [状态压缩] | Hard |
| 1486 | 数组异或操作 | [位运算] [数学] | Easy |
| 1461 | 检查一个字符串是否包含所有长度为 K 的二进制子串 | [位运算] [哈希表] [字符串] [哈希函数] [滚动哈希] | Medium |
| 1457 | 二叉树中的伪回文路径 | [位运算] [树] [深度优先搜索] [广度优先搜索] [二叉树] | Medium |
| 1442 | 形成两个异或相等数组的三元组数目 | [位运算] [数组] [哈希表] [数学] [前缀和] | Medium |
| 1434 | 每个人戴不同帽子的方案数 | [位运算] [数组] [动态规划] [状态压缩] | Hard |
| 1404 | 将二进制表示减到 1 的步骤数 | [位运算] [字符串] | Medium |
| 1386 | 安排电影院座位 | [贪心] [位运算] [数组] [哈希表] | Medium |
| 1371 | 每个元音包含偶数次的最长子字符串 | [位运算] [哈希表] [字符串] [前缀和] | Medium |
| 1356 | 根据数字二进制下 1 的数目排序 | [位运算] [数组] [计数] [排序] | Easy |
| 1349 | 参加考试的最大学生数 | [位运算] [数组] [动态规划] [状态压缩] [矩阵] | Hard |
| 1342 | 将数字变成 0 的操作次数 | [位运算] [数学] | Easy |
| 1318 | 或运算的最小翻转次数 | [位运算] | Medium |
| 1310 | 子数组异或查询 | [位运算] [数组] [前缀和] | Medium |
| 1284 | 转化为全零矩阵的最少反转次数 | [位运算] [广度优先搜索] [数组] [矩阵] | Hard |
| 1256 | 加密数字 🔒 | [位运算] [数学] [字符串] | Medium |
| 1255 | 得分最高的单词集合 | [位运算] [数组] [字符串] [动态规划] [回溯] [状态压缩] | Hard |
| 1239 | 串联字符串的最大长度 | [位运算] [数组] [字符串] [回溯] | Medium |
| 1238 | 循环码排列 | [位运算] [数学] [回溯] | Medium |
| 1178 | 猜字谜 | [位运算] [字典树] [数组] [哈希表] [字符串] | Hard |
| 1177 | 构建回文串检测 | [位运算] [哈希表] [字符串] [前缀和] | Medium |
| 1125 | 最小的必要团队 | [位运算] [数组] [动态规划] [状态压缩] | Hard |
| 1066 | 校园自行车分配 II 🔒 | [位运算] [数组] [动态规划] [回溯] [状态压缩] | Medium |
| 1009 | 十进制整数的反码 | [位运算] | Easy |
| 996 | 正方形数组的数目 | [位运算] [数组] [数学] [动态规划] [回溯] [状态压缩] | Hard |
| 995 | K 连续位的最小翻转次数 | [位运算] [数组] [前缀和] [滑动窗口] | Hard |
| 982 | 按位与为零的三元组 | [位运算] [数组] [哈希表] | Hard |
| 980 | 不同路径 III | [位运算] [数组] [回溯] [矩阵] | Hard |
| 957 | N 天后的牢房 | [位运算] [数组] [哈希表] [数学] | Medium |
| 943 | 最短超级串 | [位运算] [数组] [字符串] [动态规划] [状态压缩] | Hard |
| 898 | 子数组按位或操作 | [位运算] [数组] [动态规划] | Medium |
| 868 | 二进制间距 | [位运算] [数学] | Easy |
| 864 | 获取所有钥匙的最短路径 | [位运算] [广度优先搜索] | Hard |
| 861 | 翻转矩阵后的得分 | [贪心] [位运算] [数组] [矩阵] | Medium |
| 847 | 访问所有节点的最短路径 | [位运算] [广度优先搜索] [图] [动态规划] [状态压缩] | Hard |
| 810 | 黑板异或游戏 | [位运算] [脑筋急转弯] [数组] [数学] [博弈] | Hard |
| 805 | 数组的均值分割 | [位运算] [数组] [数学] [动态规划] [状态压缩] | Hard |
| 784 | 字母大小写全排列 | [位运算] [字符串] [回溯] | Medium |
| 782 | 变为棋盘 | [位运算] [数组] [数学] [矩阵] | Hard |
| 779 | 第K个语法符号 | [位运算] [递归] [数学] | Medium |
| 762 | 二进制表示中质数个计算置位 | [位运算] [数学] | Easy |
| 756 | 金字塔转换矩阵 | [位运算] [深度优先搜索] [广度优先搜索] | Medium |
| 751 | IP 到 CIDR 🔒 | [位运算] [字符串] | Medium |
| 698 | 划分为k个相等的子集 | [位运算] [记忆化搜索] [数组] [动态规划] [回溯] [状态压缩] | Medium |
| 693 | 交替位二进制数 | [位运算] | Easy |
| 691 | 贴纸拼词 | [位运算] [动态规划] [回溯] [状态压缩] | Hard |
| 672 | 灯泡开关 Ⅱ | [位运算] [深度优先搜索] [广度优先搜索] [数学] | Medium |
| 645 | 错误的集合 | [位运算] [数组] [哈希表] [排序] | Easy |
| 638 | 大礼包 | [位运算] [记忆化搜索] [数组] [动态规划] [回溯] [状态压缩] | Medium |
| 526 | 优美的排列 | [位运算] [数组] [动态规划] [回溯] [状态压缩] | Medium |
| 491 | 递增子序列 | [位运算] [数组] [哈希表] [回溯] | Medium |
| 477 | 汉明距离总和 | [位运算] [数组] [数学] | Medium |
| 476 | 数字的补数 | [位运算] | Easy |
| 473 | 火柴拼正方形 | [位运算] [数组] [动态规划] [回溯] [状态压缩] | Medium |
| 464 | 我能赢吗 | [位运算] [记忆化搜索] [数学] [动态规划] [状态压缩] [博弈] | Medium |
| 461 | 汉明距离 | [位运算] | Easy |
| 421 | 数组中两个数的最大异或值 | [位运算] [字典树] [数组] [哈希表] | Medium |
| 411 | 最短独占单词缩写 🔒 | [位运算] [字符串] [回溯] | Hard |
| 405 | 数字转换为十六进制数 | [位运算] [数学] | Easy |
| 401 | 二进制手表 | [位运算] [回溯] | Easy |
| 397 | 整数替换 | [贪心] [位运算] [记忆化搜索] [动态规划] | Medium |
| 393 | UTF-8 编码验证 | [位运算] [数组] | Medium |
| 389 | 找不同 | [位运算] [哈希表] [字符串] [排序] | Easy |
| 371 | 两整数之和 | [位运算] [数学] | Medium |
| 342 | 4的幂 | [位运算] [递归] [数学] | Easy |
| 338 | 比特位计数 | [位运算] [动态规划] | Easy |
| 320 | 列举单词的全部缩写 🔒 | [位运算] [字符串] [回溯] | Medium |
| 318 | 最大单词长度乘积 | [位运算] [数组] [字符串] | Medium |
| 287 | 寻找重复数 | [位运算] [数组] [双指针] [二分查找] | Medium |
| 268 | 丢失的数字 | [位运算] [数组] [哈希表] [数学] [排序] | Easy |
| 266 | 回文排列 🔒 | [位运算] [哈希表] [字符串] | Easy |
| 260 | 只出现一次的数字 III | [位运算] [数组] | Medium |
| 231 | 2 的幂 | [位运算] [递归] [数学] | Easy |
| 201 | 数字范围按位与 | [位运算] | Medium |
| 191 | 位1的个数 | [位运算] | Easy |
| 190 | 颠倒二进制位 | [位运算] [分治] | Easy |
| 187 | 重复的DNA序列 | [位运算] [哈希表] [字符串] [滑动窗口] [哈希函数] [滚动哈希] | Medium |
| 137 | 只出现一次的数字 II | [位运算] [数组] | Medium |
| 136 | 只出现一次的数字 | [位运算] [数组] | Easy |
| 90 | 子集 II | [位运算] [数组] [回溯] | Medium |
| 89 | 格雷编码 | [位运算] [数学] [回溯] | Medium |
| 78 | 子集 | [位运算] [数组] [回溯] | Medium |
| 67 | 二进制求和 | [位运算] [数学] [字符串] [模拟] | Easy |
| 29 | 两数相除 | [位运算] [数学] | Medium |