1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-02 14:12:17 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions

View File

@@ -12,7 +12,7 @@
"translatedContent": "<p>给你一个非负整数数组 <code>nums</code> ,你最初位于数组的第一个位置。</p>\n\n<p>数组中的每个元素代表你在该位置可以跳跃的最大长度。</p>\n\n<p>你的目标是使用最少的跳跃次数到达数组的最后一个位置。</p>\n\n<p>假设你总是可以到达数组的最后一个位置。</p>\n\n<p> </p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre>\n<strong>输入:</strong> nums = [2,3,1,1,4]\n<strong>输出:</strong> 2\n<strong>解释:</strong> 跳到最后一个位置的最小跳跃数是 <code>2</code>。\n  从下标为 0 跳到下标为 1 的位置,跳 <code>1</code> 步,然后跳 <code>3</code> 步到达数组的最后一个位置。\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入:</strong> nums = [2,3,0,1,4]\n<strong>输出:</strong> 2\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 <= nums.length <= 10<sup>4</sup></code></li>\n\t<li><code>0 <= nums[i] <= 1000</code></li>\n</ul>\n",
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1506,
"likes": 1510,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Jump Game\", \"titleSlug\": \"jump-game\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u8df3\\u8dc3\\u6e38\\u620f\"}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"295.3K\", \"totalSubmission\": \"668.1K\", \"totalAcceptedRaw\": 295288, \"totalSubmissionRaw\": 668096, \"acRate\": \"44.2%\"}",
"stats": "{\"totalAccepted\": \"297.2K\", \"totalSubmission\": \"672K\", \"totalAcceptedRaw\": 297162, \"totalSubmissionRaw\": 672018, \"acRate\": \"44.2%\"}",
"hints": [],
"solution": null,
"status": null,