coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-08 00:41:42 +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/maximize-value-of-function-in-a-ball-passing-game.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.7K\", \"totalSubmission\": \"12.8K\", \"totalAcceptedRaw\": 3741, \"totalSubmissionRaw\": 12847, \"acRate\": \"29.1%\"}",
"stats": "{\"totalAccepted\": \"3.7K\", \"totalSubmission\": \"12.9K\", \"totalAcceptedRaw\": 3745, \"totalSubmissionRaw\": 12857, \"acRate\": \"29.1%\"}",
"hints": [
"<div class=\"_1l1MA\">We can solve the problem using binary lifting.</div>",
"<div class=\"_1l1MA\">For each player with id <code>x</code> and for every <code>i</code> in the range <code>[0, ceil(log<sub>2</sub>k)]</code>, we can determine the last receiver's id and compute the sum of player ids who receive the ball after <code>2<sup>i</sup></code> passes, starting from <code>x</code>.</div>",