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

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 1036,
"likes": 1042,
"dislikes": 119,
"isLiked": null,
"similarQuestions": "[]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"30.5K\", \"totalSubmission\": \"79.2K\", \"totalAcceptedRaw\": 30530, \"totalSubmissionRaw\": 79186, \"acRate\": \"38.6%\"}",
"stats": "{\"totalAccepted\": \"30.6K\", \"totalSubmission\": \"79.4K\", \"totalAcceptedRaw\": 30625, \"totalSubmissionRaw\": 79372, \"acRate\": \"38.6%\"}",
"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."