Jump Game II leetcode python 2016 new Season__python

Given an array of non-negative integers, your are initially positioned at the the the the The.

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.

For example:
Given array A = [2,3,1,1,4]

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 so you can always to the last index.

Show Tags Have your met this question in a real interview? Yes No

Discuss

Class Solution (object):
    def jump (self, Nums): ""
        : Type Nums:list[int]
        : rtype:int
        "" Count = 0 Last
        = 0 reach 
        = 0 to I in
        range (len (nums)):
            If i > Last: Last
                = reach
                count + + 1< C12/>reach = max (reach, i + nums[i]) return
        count