coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-02 22:13:28 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/number-of-ways-to-reconstruct-a-tree.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"12.6K\", \"totalSubmission\": \"18K\", \"totalAcceptedRaw\": 12558, \"totalSubmissionRaw\": 17979, \"acRate\": \"69.8%\"}",
"stats": "{\"totalAccepted\": \"12.6K\", \"totalSubmission\": \"18K\", \"totalAcceptedRaw\": 12561, \"totalSubmissionRaw\": 17983, \"acRate\": \"69.8%\"}",
"hints": [
"Think inductively. The first step is to get the root. Obviously, the root should be in pairs with all the nodes. If there isn't exactly one such node, then there are 0 ways.",
"The number of pairs involving a node must be less than or equal to that number of its parent.",