coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/minimum-time-to-collect-all-apples-in-a-tree.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"28.1K\", \"totalSubmission\": \"50.6K\", \"totalAcceptedRaw\": 28141, \"totalSubmissionRaw\": 50603, \"acRate\": \"55.6%\"}",
"stats": "{\"totalAccepted\": \"28.2K\", \"totalSubmission\": \"50.7K\", \"totalAcceptedRaw\": 28191, \"totalSubmissionRaw\": 50669, \"acRate\": \"55.6%\"}",
"hints": [
"Note that if a node u contains an apple then all edges in the path from the root to the node u have to be used forward and backward (2 times).",
"Therefore use a depth-first search (DFS) to check if an edge will be used or not."