coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +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

4
leetcode/originData/maximum-number-of-jumps-to-reach-the-last-index.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 359,
"likes": 360,
"dislikes": 10,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Jump Game II\", \"titleSlug\": \"jump-game-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Frog Jump\", \"titleSlug\": \"frog-jump\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Jump Game III\", \"titleSlug\": \"jump-game-iii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Jump Game IV\", \"titleSlug\": \"jump-game-iv\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Minimum Jumps to Reach Home\", \"titleSlug\": \"minimum-jumps-to-reach-home\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Jump Game VII\", \"titleSlug\": \"jump-game-vii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"22.4K\", \"totalSubmission\": \"77.2K\", \"totalAcceptedRaw\": 22438, \"totalSubmissionRaw\": 77213, \"acRate\": \"29.1%\"}",
"stats": "{\"totalAccepted\": \"22.4K\", \"totalSubmission\": \"77.2K\", \"totalAcceptedRaw\": 22447, \"totalSubmissionRaw\": 77223, \"acRate\": \"29.1%\"}",
"hints": [
"Use a dynamic programming approach.",
"Define a dynamic programming array dp of size n, where dp[i] represents the maximum number of jumps from index 0 to index i.",