话题分类 > 图
| # | 题目 | 标签 | 难度 |
|---|---|---|---|
| 1387 | 将整数按权重排序 | [排序] [图] | Medium |
| 1361 | 验证二叉树 | [图] | Medium |
| 1334 | 阈值距离内邻居最少的城市 | [图] | Medium |
| 1306 | 跳跃游戏 III | [广度优先搜索] [图] | Medium |
| 1267 | 统计参与通信的服务器 | [图] [数组] | Medium |
| 1203 | 项目管理 | [深度优先搜索] [图] [拓扑排序] | Hard |
| 1168 | 水资源分配优化 🔒 | [并查集] [图] | Hard |
| 1162 | 地图分析 | [广度优先搜索] [图] | Medium |
| 1161 | 最大层内元素和 | [图] | Medium |
| 1153 | 字符串转化 🔒 | [图] | Hard |
| 1136 | 平行课程 🔒 | [深度优先搜索] [图] [动态规划] | Hard |
| 1135 | 最低成本联通所有城市 🔒 | [并查集] [图] | Medium |
| 1129 | 颜色交替的最短路径 | [广度优先搜索] [图] | Medium |
| 1102 | 得分最高的路径 🔒 | [深度优先搜索] [并查集] [图] | Medium |
| 1059 | 从始点到终点的所有路径 🔒 | [深度优先搜索] [图] | Medium |
| 1043 | 分隔数组以得到最大和 | [图] | Medium |
| 1042 | 不邻接植花 | [图] | Easy |
| 997 | 找到小镇的法官 | [图] | Easy |
| 996 | 正方形数组的数目 | [图] [数学] [回溯算法] | Hard |
| 990 | 等式方程的可满足性 | [并查集] [图] | Medium |
| 959 | 由斜杠划分区域 | [深度优先搜索] [并查集] [图] | Medium |
| 928 | 尽量减少恶意软件的传播 II | [深度优先搜索] [并查集] [图] | Hard |
| 854 | 相似度为 K 的字符串 | [广度优先搜索] [图] | Hard |
| 841 | 钥匙和房间 | [深度优先搜索] [图] | Medium |
| 839 | 相似字符串组 | [深度优先搜索] [并查集] [图] | Hard |
| 802 | 找到最终的安全状态 | [深度优先搜索] [图] | Medium |
| 785 | 判断二分图 | [深度优先搜索] [广度优先搜索] [图] | Medium |
| 765 | 情侣牵手 | [贪心算法] [并查集] [图] | Hard |
| 743 | 网络延迟时间 | [堆] [深度优先搜索] [广度优先搜索] [图] | Medium |
| 685 | 冗余连接 II | [树] [深度优先搜索] [并查集] [图] | Hard |
| 684 | 冗余连接 | [树] [并查集] [图] | Medium |
| 444 | 序列重建 🔒 | [图] [拓扑排序] | Medium |
| 399 | 除法求值 | [并查集] [图] | Medium |
| 332 | 重新安排行程 | [深度优先搜索] [图] | Medium |
| 323 | 无向图中连通分量的数目 🔒 | [深度优先搜索] [广度优先搜索] [并查集] [图] | Medium |
| 310 | 最小高度树 | [广度优先搜索] [图] | Medium |
| 269 | 火星词典 🔒 | [图] [拓扑排序] | Hard |
| 261 | 以图判树 🔒 | [深度优先搜索] [广度优先搜索] [并查集] [图] | Medium |
| 210 | 课程表 II | [深度优先搜索] [广度优先搜索] [图] [拓扑排序] | Medium |
| 207 | 课程表 | [深度优先搜索] [广度优先搜索] [图] [拓扑排序] | Medium |
| 133 | 克隆图 | [深度优先搜索] [广度优先搜索] [图] | Medium |