mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-05 08:27:30 +08:00
添加内容
This commit is contained in:
@ -1,7 +1,7 @@
|
||||
# [685. Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii/)
|
||||
|
||||
|
||||
## 题目:
|
||||
## 题目
|
||||
|
||||
In this problem, a rooted tree is a **directed** graph such that, there is exactly one node (the root) for which all other nodes are descendants of this node, plus every node has exactly one parent, except for the root node which has no parents.
|
||||
|
||||
|
Reference in New Issue
Block a user