话题分类 > 图
| # | 题目 | 标签 | 难度 |
|---|---|---|---|
| 2127 | 参加会议的最多员工数 | [深度优先搜索] [图] [拓扑排序] | Hard |
| 2123 | Minimum Operations to Remove Adjacent Ones in Matrix 🔒 | [图] [数组] [矩阵] | Hard |
| 2115 | 从给定原材料中找到所有可以做出的菜 | [图] [拓扑排序] [数组] [哈希表] [字符串] | Medium |
| 2101 | 引爆最多的炸弹 | [深度优先搜索] [广度优先搜索] [图] [几何] [数组] [数学] | Medium |
| 2097 | 合法重新排列数对 | [深度优先搜索] [图] [欧拉回路] | Hard |
| 2093 | Minimum Cost to Reach City With Discounts 🔒 | [图] [最短路] | Medium |
| 2092 | 找出知晓秘密的所有专家 | [深度优先搜索] [广度优先搜索] [并查集] [图] [排序] | Hard |
| 2077 | Paths in Maze That Lead to Same Room 🔒 | [图] | Medium |
| 2076 | 处理含限制条件的好友请求 | [并查集] [图] | Hard |
| 2065 | 最大化一张图中的路径价值 | [图] [数组] [回溯] | Hard |
| 2050 | 并行课程 III | [图] [拓扑排序] [动态规划] | Hard |
| 2045 | 到达目的地的第二短时间 | [广度优先搜索] [图] [最短路] | Hard |
| 2039 | 网络空闲的时刻 | [广度优先搜索] [图] [数组] | Medium |
| 1976 | 到达目的地的方案数 | [图] [拓扑排序] [动态规划] [最短路] | Medium |
| 1971 | 寻找图中是否存在路径 | [深度优先搜索] [广度优先搜索] [图] | Easy |
| 1928 | 规定时间内到达终点的最小花费 | [图] [动态规划] | Hard |
| 1916 | 统计为蚁群构筑房间的不同顺序 | [树] [图] [拓扑排序] [数学] [动态规划] [组合数学] | Hard |
| 1857 | 有向图中最大颜色值 | [图] [拓扑排序] [记忆化搜索] [哈希表] [动态规划] [计数] | Hard |
| 1810 | 隐藏网格下的最小消耗路径 🔒 | [深度优先搜索] [广度优先搜索] [图] [交互] [堆（优先队列）] | Medium |
| 1791 | 找出星型图的中心节点 | [图] | Easy |
| 1786 | 从第一个节点出发到最后一个节点的受限路径数 | [图] [拓扑排序] [动态规划] [最短路] [堆（优先队列）] | Medium |
| 1782 | 统计点对的数目 | [图] [双指针] [二分查找] | Hard |
| 1778 | 未知网格中的最短路径 🔒 | [深度优先搜索] [广度优先搜索] [图] [交互] | Medium |
| 1761 | 一个图中连通三元组的最小度数 | [图] | Hard |
| 1728 | 猫和老鼠 II | [广度优先搜索] [图] [记忆化搜索] [数学] [动态规划] [博弈] | Hard |
| 1724 | 检查边长度限制的路径是否存在 II 🔒 | [并查集] [图] [最小生成树] | Hard |
| 1719 | 重构一棵树的方案数 | [树] [图] [拓扑排序] | Hard |
| 1697 | 检查边长度限制的路径是否存在 | [并查集] [图] [数组] [排序] | Hard |
| 1632 | 矩阵转换后的秩 | [贪心] [并查集] [图] [拓扑排序] [数组] [矩阵] | Hard |
| 1615 | 最大网络秩 | [图] | Medium |
| 1591 | 奇怪的打印机 II | [图] [拓扑排序] [数组] [矩阵] | Hard |
| 1579 | 保证图可完全遍历 | [并查集] [图] | Hard |
| 1557 | 可以到达所有点的最少点数目 | [图] | Medium |
| 1548 | 图中最相似的路径 🔒 | [图] [动态规划] | Hard |
| 1514 | 概率最大的路径 | [图] [最短路] [堆（优先队列）] | Medium |
| 1494 | 并行课程 II | [位运算] [图] [动态规划] [状态压缩] | Hard |
| 1489 | 找到最小生成树里的关键边和伪关键边 | [并查集] [图] [最小生成树] [排序] [强连通分量] | Hard |
| 1466 | 重新规划路线 | [深度优先搜索] [广度优先搜索] [图] | Medium |
| 1462 | 课程表 IV | [深度优先搜索] [广度优先搜索] [图] [拓扑排序] | Medium |
| 1377 | T 秒后青蛙的位置 | [树] [深度优先搜索] [广度优先搜索] [图] | Hard |
| 1368 | 使网格图至少有一条有效路径的最小代价 | [广度优先搜索] [图] [数组] [矩阵] [最短路] [堆（优先队列）] | Hard |
| 1361 | 验证二叉树 | [树] [深度优先搜索] [广度优先搜索] [并查集] [图] [二叉树] | Medium |
| 1334 | 阈值距离内邻居最少的城市 | [图] [动态规划] [最短路] | Medium |
| 1319 | 连通网络的操作次数 | [深度优先搜索] [广度优先搜索] [并查集] [图] | Medium |
| 1203 | 项目管理 | [深度优先搜索] [广度优先搜索] [图] [拓扑排序] | Hard |
| 1192 | 查找集群内的「关键连接」 | [深度优先搜索] [图] [双连通分量] | Hard |
| 1168 | 水资源分配优化 🔒 | [并查集] [图] [最小生成树] | Hard |
| 1136 | 平行课程 🔒 | [图] [拓扑排序] | Medium |
| 1135 | 最低成本联通所有城市 🔒 | [并查集] [图] [最小生成树] [堆（优先队列）] | Medium |
| 1129 | 颜色交替的最短路径 | [广度优先搜索] [图] | Medium |
| 1059 | 从始点到终点的所有路径 🔒 | [深度优先搜索] [图] | Medium |
| 1042 | 不邻接植花 | [深度优先搜索] [广度优先搜索] [图] | Medium |
| 997 | 找到小镇的法官 | [图] [数组] [哈希表] | Easy |
| 990 | 等式方程的可满足性 | [并查集] [图] [数组] [字符串] | Medium |
| 959 | 由斜杠划分区域 | [深度优先搜索] [广度优先搜索] [并查集] [图] | Medium |
| 947 | 移除最多的同行或同列石头 | [深度优先搜索] [并查集] [图] | Medium |
| 913 | 猫和老鼠 | [广度优先搜索] [图] [记忆化搜索] [数学] [动态规划] [博弈] | Hard |
| 886 | 可能的二分法 | [深度优先搜索] [广度优先搜索] [并查集] [图] | Medium |
| 882 | 细分图中的可到达结点 | [图] [最短路] [堆（优先队列）] | Hard |
| 851 | 喧闹和富有 | [深度优先搜索] [图] [拓扑排序] [数组] | Medium |
| 847 | 访问所有节点的最短路径 | [位运算] [广度优先搜索] [图] [动态规划] [状态压缩] | Hard |
| 841 | 钥匙和房间 | [深度优先搜索] [广度优先搜索] [图] | Medium |
| 834 | 树中距离之和 | [树] [深度优先搜索] [图] [动态规划] | Hard |
| 802 | 找到最终的安全状态 | [深度优先搜索] [广度优先搜索] [图] [拓扑排序] | Medium |
| 797 | 所有可能的路径 | [深度优先搜索] [广度优先搜索] [图] [回溯] | Medium |
| 787 | K 站中转内最便宜的航班 | [深度优先搜索] [广度优先搜索] [图] [动态规划] [最短路] [堆（优先队列）] | Medium |
| 785 | 判断二分图 | [深度优先搜索] [广度优先搜索] [并查集] [图] | Medium |
| 765 | 情侣牵手 | [贪心] [深度优先搜索] [广度优先搜索] [并查集] [图] | Hard |
| 753 | 破解保险箱 | [深度优先搜索] [图] [欧拉回路] | Hard |
| 743 | 网络延迟时间 | [深度优先搜索] [广度优先搜索] [图] [最短路] [堆（优先队列）] | Medium |
| 685 | 冗余连接 II | [深度优先搜索] [广度优先搜索] [并查集] [图] | Hard |
| 684 | 冗余连接 | [深度优先搜索] [广度优先搜索] [并查集] [图] | Medium |
| 631 | 设计 Excel 求和公式 🔒 | [图] [设计] [拓扑排序] | Hard |
| 547 | 省份数量 | [深度优先搜索] [广度优先搜索] [并查集] [图] | Medium |
| 505 | 迷宫 II 🔒 | [深度优先搜索] [广度优先搜索] [图] [最短路] [堆（优先队列）] | Medium |
| 499 | 迷宫 III 🔒 | [深度优先搜索] [广度优先搜索] [图] [最短路] [堆（优先队列）] | Hard |
| 490 | 迷宫 🔒 | [深度优先搜索] [广度优先搜索] [图] | Medium |
| 444 | 序列重建 🔒 | [图] [拓扑排序] [数组] | Medium |
| 399 | 除法求值 | [深度优先搜索] [广度优先搜索] [并查集] [图] [数组] [最短路] | Medium |
| 332 | 重新安排行程 | [深度优先搜索] [图] [欧拉回路] | Hard |
| 329 | 矩阵中的最长递增路径 | [深度优先搜索] [广度优先搜索] [图] [拓扑排序] [记忆化搜索] [动态规划] | Hard |
| 323 | 无向图中连通分量的数目 🔒 | [深度优先搜索] [广度优先搜索] [并查集] [图] | Medium |
| 310 | 最小高度树 | [深度优先搜索] [广度优先搜索] [图] [拓扑排序] | Medium |
| 277 | 搜寻名人 🔒 | [贪心] [图] [双指针] [交互] | Medium |
| 269 | 火星词典 🔒 | [深度优先搜索] [广度优先搜索] [图] [拓扑排序] [数组] [字符串] | Hard |
| 261 | 以图判树 🔒 | [深度优先搜索] [广度优先搜索] [并查集] [图] | Medium |
| 210 | 课程表 II | [深度优先搜索] [广度优先搜索] [图] [拓扑排序] | Medium |
| 207 | 课程表 | [深度优先搜索] [广度优先搜索] [图] [拓扑排序] | Medium |
| 133 | 克隆图 | [深度优先搜索] [广度优先搜索] [图] [哈希表] | Medium |