coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-02 14:12:17 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/minimum-height-tree-lcci.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"39.6K\", \"totalSubmission\": \"50.3K\", \"totalAcceptedRaw\": 39632, \"totalSubmissionRaw\": 50338, \"acRate\": \"78.7%\"}",
"stats": "{\"totalAccepted\": \"39.7K\", \"totalSubmission\": \"50.4K\", \"totalAcceptedRaw\": 39697, \"totalSubmissionRaw\": 50421, \"acRate\": \"78.7%\"}",
"hints": [
"最小的二叉树在每个节点左侧的节点数与右侧相同。现在我们把注意力放到根节点上，你要如何保证位于根的左侧和右侧的节点数量大致相同呢？",
"你可以通过找到“理想”的下一个要添加的元素和多次调用insertValue来实现。这样效率会有点儿低，因为你必须反复遍历树。尝试用递归代替。你能把这个问题分解为子问题吗？",