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:
Input: nums = [2,3,1,1,4]
Output: 2
Explanation: The minimum number of jumps to reach the last index is 2. Jump 1 step from index 0 to 1, then 3 steps to the last index.
Example 2:
Input: nums = [2,3,0,1,4]
Output: 2
Constraints:
1 <= nums.length <= 1040 <= nums[i] <= 1000給定一個非負整數陣列 nums
每一個元素 nums[i] 代表該 index 所能夠 jump 的最大值
必須要從 index 0 開始 jump 到最後一個 index
要求寫一個演算法計算從 0 到最後一個 index 所需最小的 jump 個數
假設透過 Dynamic Programming