Leetcode: JumpGameII

Question : https://leetcode.com/problems/jump-game-ii/description/

Solution : 

class Solution:
        def jump(self, nums):
            if len(nums) <= 1: return 0
            l, r = 0, nums[0]
            times = 1
            while r < len(nums) - 1:
                times += 1
                nxt = max(i + nums[i] for i in range(l+1, r + 1))
                l, r = r, nxt
            return times

Passed All the test case