LeetCode刷题（18）

Jump Game II
在可选的范围内寻求最大覆盖范围

class Solution(object):
    def jump(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        res = 0
        if len(nums) <= 1:
            return res
        i = 0

        while i < len(nums):
            if i + nums[i] >= len(nums) - 1:
                return res + 1
            else :
                gmax = 0
                for j in range(nums[i]):
                    if nums[i+j+1]+i+j+1 > gmax:
                        gmax = nums[i+j+1]+i+j+1
                        g = i+j+1
                i = g
                res += 1
        return res