Leetcode_Dynamic Programming_Jump Game

class Solution:
    def canJump(self, nums: List[int]) -> bool:
        n = len(nums)
        right_most = n - 1
        for i in range(n - 2, -1, -1):
            if i + nums[i] >= right_most:
                right_most = i
        return right_most == 0