leetcode Jump Game II python

@link http://www.cnblogs.com/zuoyuan/p/3781953.html
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.

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.)

Subscribe to see which companies asked this question

class Solution(object):
    def jump(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        ret=0
        last=0
        curr=0
        for i in range(len(nums)):
　　　　　　  #this is the amazing place : ( i > last ) keep the current step
            if i > last:
                last=curr
                ret+=1
            curr=max(curr,i+nums[i])
        return ret