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

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/maximum-points-after-collecting-coins-from-all-nodes.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 124,
"dislikes": 10,
"likes": 163,
"dislikes": 11,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[[0,1],[1,2],[2,3]]\n[10,10,3,3]\n5\n[[0,1],[0,2]]\n[8,4,4]\n0",
@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.5K\", \"totalSubmission\": \"12.3K\", \"totalAcceptedRaw\": 4453, \"totalSubmissionRaw\": 12266, \"acRate\": \"36.3%\"}",
"stats": "{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"15.5K\", \"totalAcceptedRaw\": 5739, \"totalSubmissionRaw\": 15512, \"acRate\": \"37.0%\"}",
"hints": [
"Let <code>dp[x][t]</code> be the maximum points we can get from the subtree rooted at node <code>x</code> and the second operation has been used <code>t</code> times in its ancestors.",
"Note that the value of each <code>node <= 10<sup>4</sup></code>, so when <code>t >= 14</code> <code>dp[x][t]</code> is always <code>0</code>.",