coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/jump-game-v.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 627,
"likes": 650,
"dislikes": 22,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Jump Game VII\", \"titleSlug\": \"jump-game-vii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -131,7 +131,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"18.2K\", \"totalSubmission\": \"29.3K\", \"totalAcceptedRaw\": 18169, \"totalSubmissionRaw\": 29332, \"acRate\": \"61.9%\"}",
"stats": "{\"totalAccepted\": \"18.6K\", \"totalSubmission\": \"29.9K\", \"totalAcceptedRaw\": 18607, \"totalSubmissionRaw\": 29946, \"acRate\": \"62.1%\"}",
"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."