coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 00:11:41 +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-cn/originData/maximum-points-after-collecting-coins-from-all-nodes.json
View File

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"2.6K\", \"totalSubmission\": \"6.3K\", \"totalAcceptedRaw\": 2620, \"totalSubmissionRaw\": 6282, \"acRate\": \"41.7%\"}",
"stats": "{\"totalAccepted\": \"2.6K\", \"totalSubmission\": \"6.3K\", \"totalAcceptedRaw\": 2623, \"totalSubmissionRaw\": 6289, \"acRate\": \"41.7%\"}",
"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>.",