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-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/deepest-leaves-sum.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 2355,
"dislikes": 75,
"likes": 2428,
"dislikes": 77,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,2,3,4,5,null,6,7,null,null,null,null,8]\n[6,7,8,2,7,1,3,9,null,1,4,null,null,null,5]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"163.9K\", \"totalSubmission\": \"191.4K\", \"totalAcceptedRaw\": 163939, \"totalSubmissionRaw\": 191401, \"acRate\": \"85.7%\"}",
"stats": "{\"totalAccepted\": \"167.5K\", \"totalSubmission\": \"195.5K\", \"totalAcceptedRaw\": 167476, \"totalSubmissionRaw\": 195524, \"acRate\": \"85.7%\"}",
"hints": [
"Traverse the tree to find the max depth.",
"Traverse the tree again to compute the sum required."