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-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/[no content]largest-bst-subtree.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 1156,
"likes": 1158,
"dislikes": 96,
"isLiked": null,
"similarQuestions": "[]",
@@ -52,7 +52,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"80.3K\", \"totalSubmission\": \"195.6K\", \"totalAcceptedRaw\": 80263, \"totalSubmissionRaw\": 195562, \"acRate\": \"41.0%\"}",
"stats": "{\"totalAccepted\": \"80.4K\", \"totalSubmission\": \"195.9K\", \"totalAcceptedRaw\": 80416, \"totalSubmissionRaw\": 195851, \"acRate\": \"41.1%\"}",
"hints": [
"You can recursively use algorithm similar to <a href=\"https://leetcode.com/problems/validate-binary-search-tree/\">98. Validate Binary Search Tree</a> at each node of the tree, which will result in O(nlogn) time complexity."
],