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-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

4
leetcode/originData/maximum-product-of-splitted-binary-tree.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1199,
"likes": 1201,
"dislikes": 53,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Count Nodes With the Highest Score\", \"titleSlug\": \"count-nodes-with-the-highest-score\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"55.3K\", \"totalSubmission\": \"128.9K\", \"totalAcceptedRaw\": 55275, \"totalSubmissionRaw\": 128913, \"acRate\": \"42.9%\"}",
"stats": "{\"totalAccepted\": \"55.3K\", \"totalSubmission\": \"129K\", \"totalAcceptedRaw\": 55331, \"totalSubmissionRaw\": 129045, \"acRate\": \"42.9%\"}",
"hints": [
"If we know the sum of a subtree, the answer is max( (total_sum - subtree_sum) * subtree_sum) in each node."
],