coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/[no content]count-nodes-that-are-great-enough.json
View File

@@ -21,7 +21,7 @@
"topicTags": [],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"506\", \"totalSubmission\": \"839\", \"totalAcceptedRaw\": 506, \"totalSubmissionRaw\": 839, \"acRate\": \"60.3%\"}",
"stats": "{\"totalAccepted\": \"507\", \"totalSubmission\": \"840\", \"totalAcceptedRaw\": 507, \"totalSubmissionRaw\": 840, \"acRate\": \"60.4%\"}",
"hints": [
"<div class=\"_1l1MA\">For each node, calculate a list of <code>k</code> values representing <code>k</code> smallest values in the subtree of that node.</div>",
"<div class=\"_1l1MA\">To check if a node is great enough, get the described list in the first hint for its children and merge them. Since the resulting list may contain more than <code>k</code> elements, pick <code>k</code> smallest values and discard the extra ones.</div>",