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/jump-game-v.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"29.7K\", \"totalSubmission\": \"47.1K\", \"totalAcceptedRaw\": 29684, \"totalSubmissionRaw\": 47135, \"acRate\": \"63.0%\"}",
"stats": "{\"totalAccepted\": \"29.7K\", \"totalSubmission\": \"47.1K\", \"totalAcceptedRaw\": 29684, \"totalSubmissionRaw\": 47136, \"acRate\": \"63.0%\"}",
"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."