| 2157 |
字符串分组 |
[位运算] [并查集] [字符串] |
Hard |
| 2092 |
找出知晓秘密的所有专家 |
[深度优先搜索] [广度优先搜索] [并查集] [图] [排序] |
Hard |
| 2076 |
处理含限制条件的好友请求 |
[并查集] [图] |
Hard |
| 2003 |
每棵子树内缺失的最小基因值 |
[树] [深度优先搜索] [并查集] [动态规划] |
Hard |
| 1998 |
数组的最大公因数排序 |
[并查集] [数组] [数学] [排序] |
Hard |
| 1970 |
你能穿过矩阵的最后一天 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [二分查找] [矩阵] |
Hard |
| 1905 |
统计子岛屿 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Medium |
| 1724 |
检查边长度限制的路径是否存在 II 🔒 |
[并查集] [图] [最小生成树] |
Hard |
| 1722 |
执行交换操作后的最小汉明距离 |
[深度优先搜索] [并查集] [数组] |
Medium |
| 1697 |
检查边长度限制的路径是否存在 |
[并查集] [图] [数组] [排序] |
Hard |
| 1632 |
矩阵转换后的秩 |
[贪心] [并查集] [图] [拓扑排序] [数组] [矩阵] |
Hard |
| 1631 |
最小体力消耗路径 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [二分查找] [矩阵] [堆（优先队列）] |
Medium |
| 1627 |
带阈值的图连通性 |
[并查集] [数组] [数学] |
Hard |
| 1584 |
连接所有点的最小费用 |
[并查集] [数组] [最小生成树] |
Medium |
| 1579 |
保证图可完全遍历 |
[并查集] [图] |
Hard |
| 1569 |
将子数组重新排序得到同一个二叉查找树的方案数 |
[树] [并查集] [二叉搜索树] [记忆化搜索] [数组] [数学] [分治] [动态规划] [二叉树] [组合数学] |
Hard |
| 1559 |
二维网格图中探测环 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Medium |
| 1489 |
找到最小生成树里的关键边和伪关键边 |
[并查集] [图] [最小生成树] [排序] [强连通分量] |
Hard |
| 1391 |
检查网格中是否存在有效路径 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Medium |
| 1361 |
验证二叉树 |
[树] [深度优先搜索] [广度优先搜索] [并查集] [图] [二叉树] |
Medium |
| 1319 |
连通网络的操作次数 |
[深度优先搜索] [广度优先搜索] [并查集] [图] |
Medium |
| 1267 |
统计参与通信的服务器 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [计数] [矩阵] |
Medium |
| 1258 |
近义词句子 🔒 |
[并查集] [数组] [哈希表] [字符串] [回溯] |
Medium |
| 1254 |
统计封闭岛屿的数目 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Medium |
| 1202 |
交换字符串中的元素 |
[深度优先搜索] [广度优先搜索] [并查集] [哈希表] [字符串] |
Medium |
| 1168 |
水资源分配优化 🔒 |
[并查集] [图] [最小生成树] |
Hard |
| 1135 |
最低成本联通所有城市 🔒 |
[并查集] [图] [最小生成树] [堆（优先队列）] |
Medium |
| 1102 |
得分最高的路径 🔒 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] [堆（优先队列）] |
Medium |
| 1101 |
彼此熟识的最早时间 🔒 |
[并查集] [数组] |
Medium |
| 1061 |
按字典序排列最小的等效字符串 🔒 |
[并查集] [字符串] |
Medium |
| 1020 |
飞地的数量 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Medium |
| 990 |
等式方程的可满足性 |
[并查集] [图] [数组] [字符串] |
Medium |
| 959 |
由斜杠划分区域 |
[深度优先搜索] [广度优先搜索] [并查集] [图] |
Medium |
| 952 |
按公因数计算最大组件大小 |
[并查集] [数组] [数学] |
Hard |
| 947 |
移除最多的同行或同列石头 |
[深度优先搜索] [并查集] [图] |
Medium |
| 928 |
尽量减少恶意软件的传播 II |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Hard |
| 924 |
尽量减少恶意软件的传播 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Hard |
| 886 |
可能的二分法 |
[深度优先搜索] [广度优先搜索] [并查集] [图] |
Medium |
| 839 |
相似字符串组 |
[深度优先搜索] [广度优先搜索] [并查集] [字符串] |
Hard |
| 827 |
最大人工岛 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Hard |
| 803 |
打砖块 |
[并查集] [数组] [矩阵] |
Hard |
| 785 |
判断二分图 |
[深度优先搜索] [广度优先搜索] [并查集] [图] |
Medium |
| 778 |
水位上升的泳池中游泳 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [二分查找] [矩阵] [堆（优先队列）] |
Hard |
| 765 |
情侣牵手 |
[贪心] [深度优先搜索] [广度优先搜索] [并查集] [图] |
Hard |
| 737 |
句子相似性 II 🔒 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [哈希表] [字符串] |
Medium |
| 721 |
账户合并 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [字符串] |
Medium |
| 711 |
不同岛屿的数量 II 🔒 |
[深度优先搜索] [广度优先搜索] [并查集] [哈希表] [哈希函数] |
Hard |
| 695 |
岛屿的最大面积 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Medium |
| 694 |
不同岛屿的数量 🔒 |
[深度优先搜索] [广度优先搜索] [并查集] [哈希表] [哈希函数] |
Medium |
| 685 |
冗余连接 II |
[深度优先搜索] [广度优先搜索] [并查集] [图] |
Hard |
| 684 |
冗余连接 |
[深度优先搜索] [广度优先搜索] [并查集] [图] |
Medium |
| 547 |
省份数量 |
[深度优先搜索] [广度优先搜索] [并查集] [图] |
Medium |
| 399 |
除法求值 |
[深度优先搜索] [广度优先搜索] [并查集] [图] [数组] [最短路] |
Medium |
| 323 |
无向图中连通分量的数目 🔒 |
[深度优先搜索] [广度优先搜索] [并查集] [图] |
Medium |
| 305 |
岛屿数量 II 🔒 |
[并查集] [数组] |
Hard |
| 261 |
以图判树 🔒 |
[深度优先搜索] [广度优先搜索] [并查集] [图] |
Medium |
| 200 |
岛屿数量 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Medium |
| 130 |
被围绕的区域 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Medium |
| 128 |
最长连续序列 |
[并查集] [数组] [哈希表] |
Medium |