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/count-nodes-with-the-highest-score.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 370,
"dislikes": 24,
"likes": 396,
"dislikes": 26,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Sum of Distances in Tree\", \"titleSlug\": \"sum-of-distances-in-tree\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Delete Nodes And Return Forest\", \"titleSlug\": \"delete-nodes-and-return-forest\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Maximum Product of Splitted Binary Tree\", \"titleSlug\": \"maximum-product-of-splitted-binary-tree\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[-1,2,0,2,0]\n[-1,2,0]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"19.9K\", \"totalAcceptedRaw\": 9217, \"totalSubmissionRaw\": 19887, \"acRate\": \"46.3%\"}",
"stats": "{\"totalAccepted\": \"9.7K\", \"totalSubmission\": \"20.9K\", \"totalAcceptedRaw\": 9667, \"totalSubmissionRaw\": 20903, \"acRate\": \"46.2%\"}",
"hints": [
"For each node, you need to find the sizes of the subtrees rooted in each of its children. Maybe DFS?",
"How to determine the number of nodes in the rest of the tree? Can you subtract the size of the subtree rooted at the node from the total number of nodes of the tree?",