coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 3497,
"likes": 3498,
"dislikes": 303,
"isLiked": null,
"similarQuestions": "[]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"107K\", \"totalSubmission\": \"171.6K\", \"totalAcceptedRaw\": 106964, \"totalSubmissionRaw\": 171589, \"acRate\": \"62.3%\"}",
"stats": "{\"totalAccepted\": \"107K\", \"totalSubmission\": \"171.6K\", \"totalAcceptedRaw\": 106971, \"totalSubmissionRaw\": 171606, \"acRate\": \"62.3%\"}",
"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."