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-sum-bst-in-binary-tree.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 1042,
"dislikes": 119,
"likes": 1106,
"dislikes": 123,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,4,3,2,4,2,5,null,null,null,null,null,null,4,6]\n[4,3,null,1,2]\n[-4,-2,-5]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"30.6K\", \"totalSubmission\": \"79.4K\", \"totalAcceptedRaw\": 30625, \"totalSubmissionRaw\": 79372, \"acRate\": \"38.6%\"}",
"stats": "{\"totalAccepted\": \"31.9K\", \"totalSubmission\": \"82.6K\", \"totalAcceptedRaw\": 31930, \"totalSubmissionRaw\": 82566, \"acRate\": \"38.7%\"}",
"hints": [
"Create a datastructure with 4 parameters: (sum, isBST, maxLeft, minLeft).",
"In each node compute theses parameters, following the conditions of a Binary Search Tree."