human
I found an interesting problem on https://leetcode.com/problems/jump-game/:
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.

Determine if you are able to reach the last index.

Example 1:

Input: [2,3,1,1,4]
Output: true
Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.

Example 2:

Input: [3,2,1,0,4]
Output: false
Explanation: You will always arrive at index 3 no matter what. Its maximum
             jump length is 0, which makes it impossible to reach the last index.

I tried it in Python, but could not do it. Can you solve it?
assistant
#Here is Python code to determine if you are able to reach the last index.

class Solution:
     def canJump(self, nums):
         """
         :type nums: List[int]
         :rtype: bool
         """
         if (not nums) or (len(nums) == 1): return True
         status = [False] * (len(nums) - 1) + [True]
         curr = len(nums) - 1
         for j in range(len(nums) - 2, -1, -1): 
             if status[min(len(nums) - 1, j + nums[j])]: 
                 for i in range(j, curr): 
                     status[i] = True
                 curr = j
         return status[0]