You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: tag/depth-first-search/README.md
+1Lines changed: 1 addition & 0 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -9,6 +9,7 @@
9
9
10
10
| # | 题名 | 标签 | 难度 |
11
11
| :-: | - | - | :-: |
12
+
| 1080 |[根到叶路径上的不足节点](https://github.com/openset/leetcode/tree/master/problems/insufficient-nodes-in-root-to-leaf-paths)|[[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)]| Medium |
12
13
| 1061 |[按字典序排列最小的等效字符串](https://github.com/openset/leetcode/tree/master/problems/lexicographically-smallest-equivalent-string) 🔒 |[[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)][[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)]| Medium |
13
14
| 1034 |[边框着色](https://github.com/openset/leetcode/tree/master/problems/coloring-a-border)|[[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)]| Medium |
14
15
| 1028 |[从先序遍历还原二叉树](https://github.com/openset/leetcode/tree/master/problems/recover-a-tree-from-preorder-traversal)|[[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)][[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)]| Hard |
0 commit comments