coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +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/maximum-level-sum-of-a-binary-tree.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1344,
"dislikes": 54,
"likes": 1380,
"dislikes": 57,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,7,0,7,-8,null,null]\n[989,null,10250,98693,-89388,null,null,null,-32127]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"100.2K\", \"totalSubmission\": \"150.4K\", \"totalAcceptedRaw\": 100213, \"totalSubmissionRaw\": 150379, \"acRate\": \"66.6%\"}",
"stats": "{\"totalAccepted\": \"102.4K\", \"totalSubmission\": \"153.7K\", \"totalAcceptedRaw\": 102387, \"totalSubmissionRaw\": 153740, \"acRate\": \"66.6%\"}",
"hints": [
"Calculate the sum for each level then find the level with the maximum sum.",
"How can you traverse the tree ?",