coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 08:21: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

4
leetcode-cn/originData/[no content]largest-bst-subtree.json
View File

@@ -12,7 +12,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 129,
"likes": 134,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -52,7 +52,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"12.5K\", \"totalAcceptedRaw\": 5925, \"totalSubmissionRaw\": 12545, \"acRate\": \"47.2%\"}",
"stats": "{\"totalAccepted\": \"6.2K\", \"totalSubmission\": \"13K\", \"totalAcceptedRaw\": 6167, \"totalSubmissionRaw\": 12981, \"acRate\": \"47.5%\"}",
"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."
],