':type nums: List[int]
:rtype: int'

def jump(self, nums):

    nums[(-1)] = (2 ** 31)
    (nums2, l) = ([(i + j) for (i, j) in enumerate(nums)], (len(nums) - 1))
    def find_max_index(index):
        tmp = nums2[index:((index + nums[index]) + 1)]
        return (index + tmp.index(max(tmp)))
    (index, steps) = (0, 0)
    while True:
        index = find_max_index(index)
        if index:
            steps += 1
        if (index == l):
            break
    return steps
