45. Jump Game II

45. Jump Game II
    Given an array of non-negative integers, 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.
    Example: Input: [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.
    Note: You can assume that you can always reach the last index.
    
    
    class Solution:
    def jump(self, nums: List[int]) -> int:
    if len(nums) <= 1:
    return 0

    res = 1
    cur = 0
    last = nums[cur]
    
    while last < (len(nums)-1):
        tmp_cur = 0
        tmp_last = 0
    
        for index in range(cur+1, cur+1+nums[cur]):
            if (index+nums[index]) > tmp_last:
                tmp_last = index+nums[index]
                tmp_cur = index
    
        if tmp_last > last:
            res += 1
            cur = tmp_cur
            last = tmp_last
    
            pass
        pass
    
    return res