描述
Given an array of non-negative integers nums
, you are initially positioned at the first index of the array.
Each element in the array represents your maximum jump length at that position.
Your goal is to reach the last index in the minimum number of jumps.
You can assume that you can always reach the last index.
Example 1:
1 | Input: nums = [2,3,1,1,4] |
Example 2:
1 | Input: nums = [2,3,0,1,4] |
Constraints:
1 <= nums.length <= 104
0 <= nums[i] <= 1000
分析
这题用的是贪心的做法。
解决方案1(Python)
1 | class Solution: |