coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51: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/jump-game-v.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"7.6K\", \"totalSubmission\": \"12.8K\", \"totalAcceptedRaw\": 7643, \"totalSubmissionRaw\": 12787, \"acRate\": \"59.8%\"}",
"stats": "{\"totalAccepted\": \"7.6K\", \"totalSubmission\": \"12.8K\", \"totalAcceptedRaw\": 7644, \"totalSubmissionRaw\": 12790, \"acRate\": \"59.8%\"}",
"hints": [
"Use dynamic programming. dp[i] is max jumps you can do starting from index i. Answer is max(dp[i]).",
"dp[i] = 1 + max (dp[j]) where j is all indices you can reach from i."